Scheduling on uniform parallel machines to minimize maximum lateness

Operations Research Letters

Volumn 26, Issue 4, 2000, Pages 175-179

  Koulamas, Christos ^a   Kyparisis, George J ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROCESS CONTROL; SCHEDULING; THEOREM PROVING;

EARLIEST DUE DATES (EDD); UNIFORM PARALLEL MACHINES; WORST-CASE ANALYSIS;

PRODUCTION CONTROL;

EID: 0033743743     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00018-3     Document Type: Article

References (10)

1. Carlier J. Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European J. Oper. Res. 29:1987;298-306.
2. Cho Y., Sahni S. Bounds for list schedules on uniform processors. SIAM J. Comput. 9:1980;91-103.
3. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, New York.
4. Gusfield D. Bounds for naive multiple machine scheduling with release times and deadlines. J. Algorithms. 5:1984;1-6.
5. L.A. Hall, D.B. Shmoys, Approximation schemes for constrained scheduling problems, Proceedings of the 30th IEEE Symposium Foundations of Computer Science, 1989, pp. 134-139.
6. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles, 1955.
7. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P.H. Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory. 1993;445-522 North-Holland, Amsterdam.
8. Lenstra J.K. Sequencing by Enumerative Methods. Mathematical Centre Tracts. Vol. 69:1977;Centre for Mathematics and Computer Science, Amsterdam.
9. max scheduling problems J. Oper. Res. Soc. Japan. 26:1983;212-224.
10. Tanaev V.S., Gordon V.S., Shafransky Y.M. Scheduling Theory, Single-Stage Systems. 1994;Kluwer, Dordrecht.