Scheduling with release times and deadlines on a minimum number of machines

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 209-222

  Cieliebak, Mark ^a   Erlebach, Thomas ^a   Hennecke, Fabian ^a   Weber, Birgitta ^a   Widmayer, Peter ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

BIN PACKING PROBLEM; NON-PREEMPTIVE; NP COMPLETE; PROCESSING TIME; RELEASE TIME;

JOB SHOP SCHEDULING;

EID: 84863681973     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_18     Document Type: Conference Paper

References (14)

1. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J.S. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48(5): 1069-1090, 2001.
2. A. Bar-Noy, S. Guha, J.S. Naor, and B. Schieber. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31(2):331-352, 2001.
3. P. Berman and B. DasGupta. Multi-phase algorithms for throughput maximization for real-time scheduling. Journal of Combinatorial Optimization, 4(3):307-323, 2000.
4. A. Brandstädt, V.B. Le, and J.P. Spinrad. Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
5. J. Chuzhoy and S. Naor. New hardness results for congestion minimization and machine scheduling. accepted for STOC'04, 2004.
6. J. Chuzhoy, R. Ostrovsky, and Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problems. In IEEE Symposium on Foundations of Computer Science, pages 348-356, 2001.
7. M. Cieliebak, T. Erlebach, F. Hennecke, B. Weber, and P. Widmayer. Scheduling jobs on a minimum number of machines. Technical Report 419, Institute of Theoretical Computer Science, ETH Zürich, 2003.
8. E.G. Coffman Jr., M.R. Garey, and D.S. Johnson. Approximation algorithms for bin packing: A survey. In D. Hochbaum, editor, Approximation Algorithms for NP-hard Problems. PWS, 1996.
9. T. Erlebach and F.C.R. Spieksma. Interval selection: Applications, algorithms, and lower bounds. Journal of Algorithms, 46(1):27-53, 2003.
10. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.
11. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P. Zipkin, editors, Handbooks in Operations Research and Management Science, volume 4, pages 445-522. North-Holland, 1993.
12. F. Malucelli and S. Nicoloso. Shiftable interval graphs. In Proc. 6th International Conference on Graph Theory, 2000.
13. D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.
14. F.C.R. Spieksma. Approximating an interval scheduling problem. In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, volume 1444, pages 169-180. Springer-Verlag LNCS, 1998.