An approximation algorithm for schedulin
β
Heng Yang; Yinyu Ye; Jiawei Zhang
π
Article
π
2003
π
Elsevier Science
π
English
β 205 KB
We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semideΓΏnite programming-based approximation algori