论文信息 - Scheduling with a minimum number of machines

Scheduling with a minimum number of machines

We investigate the scheduling problem with release dates and deadlines on a minimum number of machines. In the case of equal release dates, we present a 2-approximation algorithm. We also show that Greedy Best-Fit (GBF) is a 6-approximation algorithm for the case of equal processing times.

Guochuan Zhang | Guosong Yu | Guochuan Zhang | Guosong Yu

[1] Stephan Eidenbenz,et al. Flexible Train Rostering , 2003, ISAAC.

[2] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .

[3] F. Spieksma. On the approximability of an interval scheduling problem , 1999 .

[4] Thomas Erlebach,et al. Scheduling with Release Times and Deadlines on a Minimum Number of Machines , 2004, IFIP TCS.

[5] Rafail Ostrovsky,et al. Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems , 2006, Math. Oper. Res..

[6] Frits C. R. Spieksma,et al. Interval selection: Applications, algorithms, and lower bounds , 2003, J. Algorithms.

[7] Sudipto Guha,et al. Machine minimization for scheduling jobs with interval constraints , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[10] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .

[11] Éva Tardos,et al. Algorithm design , 2005 .