On some special cases of the restricted assignment problem
C Wang, R Sitters - Information Processing Letters, 2016 - Elsevier
We consider some special cases of the restricted assignment problem. In this scheduling
problem on parallel machines, any job j can only be assigned to one of the machines in its
given subset M j of machines. We give an LP-formulation for the problem with two job sizes
and show that it has an integral optimal solution. We also present a PTAS for the case that
the M j's are intervals of the same length. Further, we give a new and very simple algorithm
for the case that| M j|= 2 (known as the graph balancing problem) with ratio 11/6.
problem on parallel machines, any job j can only be assigned to one of the machines in its
given subset M j of machines. We give an LP-formulation for the problem with two job sizes
and show that it has an integral optimal solution. We also present a PTAS for the case that
the M j's are intervals of the same length. Further, we give a new and very simple algorithm
for the case that| M j|= 2 (known as the graph balancing problem) with ratio 11/6.
Showing the best result for this search. See all results