Lower bounds for the head-body-tail problem on parallel machines: A computational study of the multiprocessor flow shop

INFORMS Journal on Computing

Volumn 17, Issue 3, 2005, Pages 305-320

  Vandevelde, Ann ^a   Hoogeveen, Han ^b   Hurkens, Cor ^c   Lenstra, Jan Karel ^d  

^a Netherlands Controlling Authority for Milk and Milk Products   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d CWI   (Netherlands)

Author keywords

Computational study; Head body tail problems; Lower bound; Multiprocessor flow shop; Parallel machine scheduling; Preemptive schedule

Indexed keywords

EID: 25144447685     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0082     Document Type: Article

References (27)

1. Baptiste, P., C. Le Pape, W. Nuijten. 2001. Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer, Boston, MA.
2. Brah, S. A., J. L. Hunsucker. 1991. Branch-and-bound algorithms for the flow shop with multiple processors. Eur. J. Oper, Res. 51 88-99.
3. Buten, R. E., V. Y. Shen. 1973. A scheduling model for computer systems with two classes of processors. Proc 1973 Sagamore Computer Conference Parallel Processing, 130-138.
4. Carlier, J. 1987. Scheduling jobs with release dates and tails on identical machines to minimize the makespan. Eur, J. Oper. Res. 29 298-306.
5. max scheduling problem. Ann. Oper. Res. 83 41-58.
6. Chen, B. 1994. Scheduling multiprocessor flow shops. D. Z. Du, J. Sun, eds. New Advances in Optimization and Approximation. Kluwer, Boston, MA, 1-8.
7. Chen, B. 1995. Analysis of classes of heuristics for scheduling two-stage flow shops with parallel machines at one stage. J. Oper. Res. Soc. 46 234-244.
8. Gharbi, A., M. Haouari. 2002. Minimizing makespan on parallel machines subject to release dates and delivery times. J. Scheduling 5 329-355.
9. Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann, Discrete Math. 5 287-326.
10. Gupta, J. N. D., A. M. A. Hariri, C. N. Potts. 1997. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann. Oper. Res. 69 171-191.
11. Haouari, M., A. Gharbi. 2003. An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. Oper. Res. Lett. 31 49-52.
12. Hoogeveen, J. A., J. K. Lenstra, B. Veltman. 1996. Minimizing the makespan in a multiprocessor flow shop is strongly NP-hard. Eur. J. Oper. Res. 89 172-175.
13. Horn, W. A. 1974. Some simple scheduling algorithms. Naval Res. Logistics Quart. 21 177-185.
14. Johnson, S. M. 1954. Optimal two- and three-stage production schedules with set-up times included. Naval Res. Logistics Quart. 1 61-68.
15. Jurisch, B. 1995. Lower bounds for the job-shop scheduling problem on multi-purpose machines. Discrete Appl. Math. 58 145-156.
16. Labetoulle, J., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1984. Preemptive scheduling of uniform machines subject to release dates. W. R. Pulleyblank, ed. Progress in Combinatorial Optimization. Academic Press, Toronto, Canada, 245-261.
17. Langston, M. A. 1987. Interstage transportation planning in the deterministic flow-shop environment. Oper. Res. 35 556-564.
18. Lee, C. Y., G. L. Vairaktarakis. 1994. Minimizing makespan in hybrid flowshops. Oper. Res. Lett. 16 149-158.
19. Mastrolilli, M., L. M. Gambardella. 2000. Effective neighborhood functions for the flexible job shop problem. J. Scheduling 3 3-20.
20. McNaughton, R. 1959. Scheduling with deadlines and loss functions. Management Sci. 6 1-12.
21. Perregaard, M. 1995. Branch-and-bound methods for the multi-processor job shop and flow shop scheduling problems. Master's thesis, Department of Computer Science, University of Copenhagen, Copenhagen, Denmark.
22. Portmann, M.-C., A. Vignier, D. Dardilhac, D. Dezalay. 1998. Branch and bound crossed with GA to solve hybrid flowshops. Eur. J. Oper. Res. 107 389-400.
23. Sanlaville, E. 1995. Nearly on line scheduling of preemptive independent tasks. Discrete Appl. Math. 57 229-241.
24. Santos, D. L., J. L. Hunsucker, D. E. Deal. 1995. Global lower bounds for flow shops with multiple processors. Eur. J. Oper. Res. 80 112-120.
25. Sriskandarajah, C., S. P. Sethi. 1989. Scheduling algorithms for flexible flowshops: Worst and average performance. Eur. J. Oper. Res. 43 143-160.
26. Vandevelde, A. 1994. Minimizing the makespan in a multiprocessor flow shop. Master's thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands.
27. Webster, S. T. 1996. A general lower bound for the makespan problem. Eur. J. Oper. Res. 89 516-524.