Advertisement

Optimization Letters

, Volume 8, Issue 8, pp 2329–2339 | Cite as

Exact resolution of the two-stage hybrid flow shop with dedicated machines

  • Hatem HaddaEmail author
  • Najoua Dridi
  • Sonia Hajri-Gabouj
Original Paper

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.

Keywords

Scheduling Hybrid flow shop Dedicated machines   Branch and bound Elimination rule 

Notes

Acknowledgments

The authors thank the three referees for a careful reading of an earlier version of this paper and for their constructive comments.

References

  1. 1.
    Carlier, J., Rebai, I.: Two branch and bound algorithms for the permutation flow shop problem. Eur. J. Oper. Res. 90, 238–251 (1996)CrossRefzbMATHGoogle Scholar
  2. 2.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Hadda, H.: A note on a heuristic method for two-stage hybrid flow shop with dedicated machines. Comput. Oper. Res. 40(10), 2283 (2013)CrossRefMathSciNetGoogle Scholar
  6. 6.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)CrossRefzbMATHGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)CrossRefzbMATHGoogle Scholar
  11. 11.
    Shijin, W., Ming, L.: A heuristic for two-stage hybrid flow shop with dedicated machines. Comput. Oper. Res. 40, 438–450 (2013)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.LISI, INSAT-TunisTunis CedexTunisia
  2. 2.Unité de Recherche OASIS, ENITTunisTunisia

Personalised recommendations