Minimizing makespan on parallel machines subject to release dates and delivery times

Journal of Scheduling

Volumn 5, Issue 4, 2002, Pages 329-355

  Gharbi, Anis ^a   Haouari, Mohamed ^a  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

Branch and bound; Delivery times; Identical parallel machines; Makespan; Release dates; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; PROBLEM SOLVING;

DELIVERY TIMES; MAKESPAN; RELEASE DATES;

SCHEDULING;

EID: 0347649432     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.103     Document Type: Article

References (20)

1. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys D. Sequencing and scheduling: algorithms and complexity. Handbooks in Operations Research and Management Science 1993; 4:445-522.
2. Lageweg BJ, Lenstra JK, Rinnooy Kan AHG. Minimizing maximum lateness on one machine: computational experience and some applications. Statistica Neerlandica 1976; 30:25-41.
3. Garey MR, Johnson DS. Strong NP-completeness results: Motivation, examples and implications. Journal of the Association of Computer Machinery 1978; 25:499-508.
4. Horn WA. Some simple scheduling algorithms. Naval Research Logistics Quarterly 1974; 21:177-185.
5. Simons B, Warmuth M. A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing 1989; 18:690-710.
6. Carlier J. Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research 1987; 29:298-306.
7. Gusfield D. Bounds for naive multiple machine scheduling with release times and deadlines. Journal of Algorithms 1984; 5:1-6.
8. Bratley P, Florian M, Robillard P. Scheduling with earliest start and due date constraints on multiple machines. Naval Research Logistics Quarterly 1975; 22:165-173.
9. Lancia G. Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. European Journal of Operational Research 2000; 120:277-288.
10. Dessouky MM. Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Computers and Industrial Engineering 1998; 34:793-806.
11. Carlier J. The one machine sequencing problem. European Journal of Operational Research 1982; 11:42-47.
12. Nuijten WPM, Aarts EHL. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research 1996; 90:269-284.
13. Sule DR, Vijayasundaram K. A heuristic procedure for makespan minimization in job shops with multiple identical processors. Computers and Industrial Engineering 1998; 35:399-402.
14. Adams J, Balas E, Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 1988; 34:391-401.
15. Hoffman K, Padberg M. Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal on Computing 1991; 3:121-135.
16. Savelsbergh MWP. Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing 1994; 6:445-454.
17. Vandevelde A. Minimizing the makespan in a multiprocessor flow shop. Master's Thesis, Eindhoven University of Technology, The Netherlands, 1994.
18. max scheduling problem. Annals of Operations Research 1998; 83:41-58.
19. Webster ST. A general lower bound for the makespan problem. European Journal of Operational Research 1996; 89:516-524.
20. Schmidt G. Scheduling with limited machine availability. European Journal of Operational Research 2000; 121:1-15.