A theoretical and empirical study of the weighted completion time minimization problem with capacitated parallel machines
The weighted completion time minimization problem for capacitated parallel machines is a fundamental problem in modern cloud computing environments. Because of the problem’s NP-hardness, we study heuristic approaches with provable approximation guarantees. Via a numerical study and a developed mixed integer linear program of the problem, we demonstrate the performance of the suggested algorithm with respect to the optimal solutions and other alternative scheduling methods.
https://technion.zoom.us/j/3800541616
