Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times

  • João Vitor Moccellin
  • Marcelo Seido Nagano
  • Anselmo Ramalho Pitombeira Neto
  • Bruno de Athayde Prata
Technical Paper


We investigate a new variant of the hybrid flow shop problem (HFSP) considering machine blocking and both sequence-independent and sequence-dependent setup times. Since the HFSP is NP-hard, we propose heuristic algorithms along with priority rules based on the traditional SPT and LPT rules. We carried out computational experiments on simulated problem instances to test the performance of the priority rules. The objective function adopted was makespan minimization, and we used the rate of success and the relative deviation as performance criteria. The results indicate superiority of LPT-based rules. On instances with sequence-independent setup times, the LP rule, which is based on the non-increasing sorting of total processing times, outperformed other rules in most tested instances. In instances with sequence-dependent setup times, the LPS rule, which is based on the non-increasing sum of processing time and average setup times, outperformed other rules in most tested instances.


Production scheduling Machine blocking Sequence-independent setup times Sequence-dependent setup times 



The support of the National Council for Scientific and Technological Development (CNPq) is acknowledged and appreciated.


  1. 1.
    Choong F, Phon-Amnuaisuk S, Alias MY (2011) Metaheuristic methods in hybrid flow shop scheduling problem. Expert Syst Appl 38:10787–10793CrossRefGoogle Scholar
  2. 2.
    Ebrahimi M, Fatemi Ghomi SMT, Karimi B (2014) Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl Math Model 38:2490–2504MathSciNetCrossRefGoogle Scholar
  3. 3.
    Elmi A, Topaloglu S (2013) A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots. Comput Oper Res 40:2543–2555MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Fattahi P, Hosseini SMH, Jolai F, Tavakkoli-Moghaddam R (2014) A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations. Appl Math Model 38:119–134MathSciNetCrossRefGoogle Scholar
  5. 5.
    Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Hidri L, Haouari M (2011) Bounding strategies for the hybrid flow shop scheduling problem. Appl Math Comput 217(21):8248–8263MathSciNetMATHGoogle Scholar
  7. 7.
    Kis T, Pesch E (2005) A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur J Oper Res 164:592–608MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37(1):57–61CrossRefGoogle Scholar
  9. 9.
    Luo H, Du B, Huang GQ, Chen H, Li X (2013) Hybrid flow shop scheduling considering machine electricity consumption cost. Int J Prod Econ 146:423–439CrossRefGoogle Scholar
  10. 10.
    Moccellin JV, Nagano MS (2011) Heuristic for flow shop sequencing with separated and sequence-independent setup times. J Braz Soc Mech Sci Eng 33:74–78CrossRefGoogle Scholar
  11. 11.
    Mousavi SM, Zandieh M, Amiri M (2011) An efficient bi-objective heuristic for scheduling of hybrid flow shops. Int J Adv Manuf Technol 54:287–307CrossRefGoogle Scholar
  12. 12.
    Nagano MS, Araujo DC (2014) New heuristics for the no-wait flowshop with sequence-dependent setup times problem. J Braz Soc Mech Sci Eng 36:139–151CrossRefGoogle Scholar
  13. 13.
    Pinedo ML (2008) Scheduling: theory, algorithms and systems, 3rd edn. Springer, New YorkMATHGoogle Scholar
  14. 14.
    Quadt D, Kuhn H (2007) A taxonomy of flexible flow line scheduling procedures. Eur J Oper Res 178(3):686–698MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Ribas I, Leisten R, Framinan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37:1439–1454MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1–18MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Vignier A, Billaut JC, Proust C (1999) Les problèmes d’ordonnancement de type flow-shop hybride: état de l’art. RAIRO 33(2):117–183CrossRefMATHGoogle Scholar
  18. 18.
    Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22:78–85CrossRefGoogle Scholar
  19. 19.
    Zhang Y, Liang X, Li W, Zhang Y (2013) Hybrid flow shop problem with blocking and multi- product families in a maritime terminal. In: 2013 IEEE 10th International Conference on Networking, Sensing and Control (ICNSC)Google Scholar

Copyright information

© The Brazilian Society of Mechanical Sciences and Engineering 2018

Authors and Affiliations

  • João Vitor Moccellin
    • 1
  • Marcelo Seido Nagano
    • 2
  • Anselmo Ramalho Pitombeira Neto
    • 1
  • Bruno de Athayde Prata
    • 1
  1. 1.Department of Industrial EngineeringFederal University of CearáFortalezaBrazil
  2. 2.Department of Industrial EngineeringUniversity of São PauloSão CarlosBrazil

Personalised recommendations