Abstract
We present an exact branch-and-bound algorithm for the two-stage hybrid flow shop problem with multiple identical machines in each stage. The objective is to schedule a set of jobs so as to minimize the makespan. This is the first exact procedure which has been specifically designed for this strongly \(\mathcal{NP}\)-hard problem. Among other features, our algorithm is based on the exact solution of identical parallel machine scheduling problems with heads and tails. We report the results of extensive computational experiments on instances which show that the proposed algorithm solves large-scale instances in moderate CPU time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34:391–401
Brah SA, Hunsucker JL (1991) Branch and bound method for the flow shop with multiple processors. Eur J Oper Res 51:88–99
Brucker P, Jurisch B, Kramer A (1994) The job–shop problem and immediate selection. Ann Oper Res 50:73–114
Brucker P (1998) Scheduling algorithms. Springer, Berlin Heidelberg New York Germany
Buten RE, Shen VY (1973) A scheduling model for computer systems with two classes of processors. In: Proceedings of the sagmore computer conference on parallel processing, pp 130–138
Carlier J (1987) Scheduling jobs with release dates and tails on identical machines to minimize the makespan. Eur J Oper Res 29:298–306
Carlier J, Pinson E (1994) Adjustment of heads and tails for the job-shop problem. Eur J Oper Res 78:146–161
Carlier J, Néron E (2000) An exact method for solving the multiprocessor flowshop. RAIRO-Oper Res 34:1–25
Gharbi A, Haouari M (2002) Minimizing makespan on parallel machines subject to release dates and delivery times. J Scheduling 5:329–355
Gharbi A, Haouari M (2004) Optimal parallel machines scheduling with initial and final availability constraints. In: Proceedings of the ninth international workshop on project management and scheduling PMS, pp 218–221
Gharbi A, Haouari M (2005) Optimal parallel machines scheduling with availability constraints. Discrete Appl Math (in press)
Gupta JND, Hariri AMA, Potts CN (1997) Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann Oper Res 69:171–191
Haouari M, M’Hallah R (1997) Heuristic algorithms for the two-stage hybrid flowshop problem. Oper Res Lett 21:43–53
Haouari M, Gharbi A (2004) Lower bounds for scheduling on identical parallel machines with heads and tails. Ann Oper Res 129:187–204
Hoogeveen JA, Lenstra JK, Veltman B (1996) Preemptive scheduling in a two-stage multiprocessor flow shop is NP-Hard. Eur J Oper Res 89:172–175
Karp RM (1972) Reducibility among combinatorial problems in complexity of computer computations. In: Miller RE, Thatcher JW, (eds) Plenum Press, New York, pp 85–103
Kis T, Pesch E (2004) A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur J Oper Res (in press)
Langston MA (1987) Interstage transportation planning in the deterministic flowshop environment. Oper Res 35:556–564
Lee CY (1991) Parallel machine scheduling with non-simultaneous machine available time. Discrete Appl Math 30:53–61
Lee CY, Vairaktarakis GL (1994) Minimizing makespan in hybrid flowshop. Oper Res Lett 16:149–158
Lee CY, He Y, Tang G (2000) A note on parallel machine scheduling with non-simultaneous machine available time. Discrete Appl Math 100: 133–135
Lin HT, Liao CJ (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Product Econ 86:133–143
Lopez P, Erschler J , Esquirol P (1992) Ordonnancement de tâches sous contraintes: une approche énergétique. RAIRO-APII 26:453–481
Moursli O, Pochet Y (2000) A branch and bound algorithm for the hybrid flowshop. Int J Product Econ 64:113–125
Narasimhan SL, Panwalker SS (1984) Scheduling in a two-stage manufacturing process. Int J Product Res 22:555–564
Néron E, Baptiste Ph, Gupta JND (2001) Solving hybrid flow shop problem using the energetic reasoning and global operations. Omega 29:501–511
Perregaard M (1995) Branch and bound method for the multiprocessor jobshop and flowshop scheduling problem. Master thesis, Department of Computer Science, University of Copenhagen
Portman MC, Vignier A, Dardilhac D, Dezalay D (1998) Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res 107:389–400
Rajendran C, Chaudhuri D (1992) Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan. Int J Product Econ 27:137–143
Salvador MS (1973) A solution to a special class of flow shop scheduling problems. In: Elmaghraby SE (ed) Symposium of the theory of scheduling and applications. Springer, Berlin Heidelberg New York, pp 83–91
Schmidt G (2000)Scheduling with limited machine availability. Eur J Oper Res 121:1–15
Schuurman P, Woeginger GJ (2000) A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor Comput Sci 237:105–122
Sherali HD, Sarin SC, Kodialam MS (1990) Models and algorithms for a two-stage production process. Product Plan Control 1:27–39
Sriskandarajah C, Sethi SP (1989) Scheduling algorithms for flexible flowshops : worst and average case performance. Eur J Oper Res 43:143–160
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Haouari, M., Hidri, L. & Gharbi, A. Optimal Scheduling of a Two-stage Hybrid Flow Shop. Math Meth Oper Res 64, 107–124 (2006). https://doi.org/10.1007/s00186-006-0066-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-006-0066-4