200 search results - page 6 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
DISOPT
2006
13 years 7 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
ECCC
2000
13 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...