On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine
ESA, pp. 31:1-31:14, 2017.
We study the classical scheduling problem of assigning jobs to machines in order to minimize the makespan. It is well-studied and admits an EPTAS on identical machines and a (2-1/m)-approximation algorithm on unrelated machines. In this paper we study a variation in which the input jobs are partitioned into bags and no two jobs from the s...More
Full Text (Upload PDF)
PPT (Upload PPT)