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
This is a preview of subscription content, log in to check access
The support of the National Council for Scientific and Technological Development (CNPq) is acknowledged and appreciated.
Choong F, Phon-Amnuaisuk S, Alias MY (2011) Metaheuristic methods in hybrid flow shop scheduling problem. Expert Syst Appl 38:10787–10793CrossRefGoogle Scholar
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
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
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
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
Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22:78–85CrossRefGoogle Scholar
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