New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times

Abstract Just-in-time production in large enterprises along with the factory’s limited space highlights the need for scheduling tools that consider blocking conditions. This study contributes to the scheduling literature by developing an effective metaheuristic to address the Blocking Flowshop Scheduling Problems with Sequence-Dependent Setup-Times (BFSP with SDSTs). Including a new constructive heuristic and a local search mechanism customized for the blocking and setup time features, the Extended Iterated Greedy (EIG) algorithm effectively solves this highly intractable scheduling extension. The performance of the EIG algorithm is compared with that of the best-performing algorithms in the literature developed to solve the BFSP with SDSTs. Extensive numerical tests and statistical analyses verify EIG’s superiority over the benchmark algorithms and show that EIG performs steadily over various operational situations. Applications of the improved Iterated Greedy in this study are worthwhile topics to solve other complex scheduling problems.

[1]  Wajdi Trabelsi,et al.  Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems , 2012, Comput. Oper. Res..

[2]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[3]  Jianyong Sun,et al.  A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems , 2018, Knowl. Based Syst..

[4]  Imma Ribas,et al.  Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization , 2015, Comput. Ind. Eng..

[5]  Dechang Pi,et al.  An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem , 2019, Eng. Appl. Artif. Intell..

[6]  Lixin Tang,et al.  A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..

[7]  Eugene Santos,et al.  Flow shop scheduling with blocking using modified harmony search algorithm with neighboring heuristics methods , 2019, Appl. Soft Comput..

[8]  Marcelo Seido Nagano,et al.  The blocking flow shop scheduling problem: A comprehensive and conceptual review , 2019, Expert Syst. Appl..

[9]  Tadeusz Sawik,et al.  A scheduling algorithm for flexible flow lines with limited intermediate buffers , 1993 .

[10]  Christos T. Maravelias,et al.  Preprocessing and tightening methods for time-indexed MIP chemical production scheduling models , 2016, Comput. Chem. Eng..

[11]  D. Gong,et al.  Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm , 2016 .

[12]  Marcelo Seido Nagano,et al.  A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times , 2017 .

[13]  Dechang Pi,et al.  Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem , 2017 .

[14]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[15]  Ghasem Moslehi,et al.  Optimizing blocking flow shop scheduling problem with total completion time criterion , 2013, Comput. Oper. Res..

[16]  Quan-Ke Pan,et al.  Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time , 2016, Appl. Soft Comput..

[17]  Rubén Ruiz,et al.  An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems , 2018, IEEE Transactions on Cybernetics.

[18]  Abdul Sattar,et al.  Scatter search for mixed blocking flowshop scheduling , 2017, Expert Syst. Appl..

[19]  Xavier Tort-Martorell,et al.  Efficient heuristics for the parallel blocking flow shop scheduling problem , 2017, Expert Syst. Appl..

[20]  Mehmet Fatih Tasgetiren,et al.  Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion , 2017, Comput. Oper. Res..

[21]  Atabak Elmi,et al.  A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots , 2013, Comput. Oper. Res..

[22]  Abdul Sattar,et al.  Scheduling blocking flowshops with setup times via constraint guided and accelerated local search , 2019, Comput. Oper. Res..

[23]  Chen-Yang Cheng,et al.  Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times , 2020, IEEE Access.

[24]  RibasImma,et al.  An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization , 2015 .

[25]  Zhi Yang,et al.  A hybrid multi-objective gray wolf optimization algorithm for a fuzzy blocking flow shop scheduling problem , 2018 .

[26]  Shih-Wei Lin,et al.  Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm , 2013 .

[27]  Yoram Koren,et al.  Value creation through design for scalability of reconfigurable manufacturing systems , 2017, Int. J. Prod. Res..

[28]  Dexuan Zou,et al.  Solving the dynamic economic dispatch by a memory-based global differential evolution and a repair technique of constraint handling , 2018 .

[29]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[30]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[31]  Yazid Mati,et al.  Complexity of flowshop scheduling problems with a new blocking constraint , 2003, Eur. J. Oper. Res..

[32]  Shih-Wei Lin,et al.  Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms , 2017, IEEE Access.

[33]  Tadeusz Sawik,et al.  Scheduling flexible flow lines with no in-process buffers , 1995 .

[34]  Chen-Yang Cheng,et al.  Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems , 2021, Expert Syst. Appl..

[35]  Dechang Pi,et al.  Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness , 2017, Comput. Ind. Eng..

[36]  Marcelo Seido Nagano,et al.  An evolutionary clustering search for the total tardiness blocking flow shop problem , 2017, Journal of Intelligent Manufacturing.

[37]  Dechang Pi,et al.  A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times , 2017, Swarm Evol. Comput..

[38]  Victor Fernandez-Viagas,et al.  A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime , 2016, Expert Syst. Appl..

[39]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[40]  Marcelo Seido Nagano,et al.  Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times , 2019, International Journal of Industrial Engineering Computations.

[41]  Chen-Yang Cheng,et al.  Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops , 2020, IEEE Access.

[42]  Said Aqil,et al.  On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time , 2019, Ann. Oper. Res..

[43]  Farahbod Mohammadi,et al.  Part Deployment Model Using Combined Quality Function Deployment and Cybernetic Fuzzy Analytic Network Process , 2013 .

[44]  Rubén Ruiz,et al.  Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..

[45]  Quan-Ke Pan,et al.  Local search methods for the flowshop scheduling problem with flowtime minimization , 2012, Eur. J. Oper. Res..

[46]  Andries Petrus Engelbrecht,et al.  A parameter-free particle swarm optimization algorithm using performance classifiers , 2019, Inf. Sci..

[47]  Xavier Tort-Martorell,et al.  An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem , 2019, Expert Syst. Appl..

[48]  Chen-Yang Cheng,et al.  Improved Beam Search for Optimizing No-Wait Flowshops With Release Times , 2020, IEEE Access.

[49]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[50]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[51]  Sara Hatami,et al.  Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times , 2015 .

[52]  Rui Xu,et al.  A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blocking , 2014 .

[53]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[54]  Shih-Wei Lin,et al.  Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness , 2015, Appl. Soft Comput..