Abstract
In this paper we introduce a branch and bound algorithm for the two-stage hybrid flow shop problem with dedicated machines. An elimination rule is used to enhance the algorithm’s performances. Experimental results show that big size instances are solved and that the elimination rule contributed to discard up to 50 % of the nodes. We also propose an empirical analysis of the makespan distribution for small sizes instances.
Similar content being viewed by others
References
Carlier, J., Rebai, I.: Two branch and bound algorithms for the permutation flow shop problem. Eur. J. Oper. Res. 90, 238–251 (1996)
Dridi, N., Hadda, H., Hajri-Gabouj, S.: Méthode heuristique pour le problème de flow shop hybride avec machines dédiées. RAIRO Oper. Res. 43, 421–436 (2009)
Hadda, H., Dridi, N., Hajri-Gabouj, S.: Etude du flow shop hybride à deux étages avec machines dédiées sous contrainte d’indisponibilité. In: Proceeding of the fifth International Conference: Integrated Design and Production. Rabat, Morocco (2007)
Hadda, H., Dridi, N., Hajri-Gabouj, S.: A note on the two-stage hybrid flow shop problem with dedicated machines. Optim. Lett. 6(8), 1731–1736 (2012)
Hadda, H.: A note on a heuristic method for two-stage hybrid flow shop with dedicated machines. Comput. Oper. Res. 40(10), 2283 (2013)
Lin, B.M.T.: The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine. Comput. Oper. Res. 26(7), 695–698 (1999)
Lin, H.T., Liao, C.J.: A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int. J. Prod. Econ. 86(2), 133–143 (2003)
Oguz, C., Lin, B.M.T., Cheng, T.C.E.: Two-stage flowshop scheduling with common second stage machine. Comput. Oper. Res. 24(12), 1169–1174 (1997)
Riane, F., Artiba, A., Elmaghraby, S.E.: Sequencing hybrid two-stage flow shop with dedicated machines. 3ème conférence francophone de modélisation et simulation, MOSIM’01, Troyes, France, pp. 591–597 (2001)
Riane, F., Artiba, A., Elmaghraby, S.E.: A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. Eur. J. Oper. Res. 109(2), 321–329 (1998)
Shijin, W., Ming, L.: A heuristic for two-stage hybrid flow shop with dedicated machines. Comput. Oper. Res. 40, 438–450 (2013)
Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)
Acknowledgments
The authors thank the three referees for a careful reading of an earlier version of this paper and for their constructive comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hadda, H., Dridi, N. & Hajri-Gabouj, S. Exact resolution of the two-stage hybrid flow shop with dedicated machines. Optim Lett 8, 2329–2339 (2014). https://doi.org/10.1007/s11590-014-0741-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-014-0741-y