On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine

ESA, pp. 31:1-31:14, 2017.

Cited by: 5|Bibtex|Views8
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments