New benchmark algorithm for hybrid flowshop scheduling with identical machines

Abstract With many industrial applications in the production sector, the hybrid flowshop scheduling problem (HFSP) has received wide recognition in the scheduling literature. Given the NP-hard nature of the HFSP, which is characterized by highly intractable solution spaces, effective solution approaches are of particular interest to facilitate the real-world use cases. This study proposes a new benchmark metaheuristic, the Chaos-enhanced Simulated Annealing (CSA) algorithm to minimize makespan in the HFSP with identical machines. A recently published testbed is used to evaluate the performance of CSA against that of the upper bounds/best-known solutions in the literature. Besides improving the upper bounds, the computational results revealed that CSA performed very well in terms of computational efficiency and stability. The proposed CSA can serve as a strong benchmark algorithm for developing more algorithms to effectively and efficiently solve HFSPs and its extensions.

[1]  Angelo A. Beltran,et al.  A Chaos-Enhanced Particle Swarm Optimization with Adaptive Parameters and Its Application in Maximum Power Point Tracking , 2016 .

[2]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning , 2013, Comput. Oper. Res..

[3]  Jairo R. Montoya-Torres,et al.  Scheduling jobs on a k-stage flexible flow-shop , 2004, Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004..

[4]  Ching-Jong Liao,et al.  An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem , 2012, Appl. Soft Comput..

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

[6]  Orhan Engin,et al.  Using ant colony optimization to solve hybrid flow shop scheduling problems , 2007 .

[7]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[8]  Samira Sadaoui,et al.  Chaos-based Discrete Firefly Algorithm for Constraint Satisfaction Problems , 2019, ICAART.

[9]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[10]  Bilal Alatas,et al.  Chaotic harmony search algorithms , 2010, Appl. Math. Comput..

[11]  Shengyao Wang,et al.  An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines , 2013 .

[12]  Xinyu Shao,et al.  Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines , 2018, Int. J. Prod. Res..

[13]  Bilal Alatas,et al.  Chaotic bee colony algorithms for global numerical optimization , 2010, Expert Syst. Appl..

[14]  Jacques Carlier,et al.  An Exact Method for Solving the Multi-Processor Flow-Shop , 2000, RAIRO Oper. Res..

[15]  Wenhong Tian,et al.  A distributed coevolutionary algorithm for multiobjective hybrid flowshop scheduling problems , 2014 .

[16]  Shih-Wei Lin,et al.  Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks , 2018, Expert Syst. Appl..

[17]  Panos M. Pardalos,et al.  Scheduling a realistic hybrid flow shop with stage skipping and adjustable processing time in steel plants , 2018, Appl. Soft Comput..

[18]  Oscar Castillo,et al.  A state of the art review of intelligent scheduling , 2018, Artificial Intelligence Review.

[19]  Carlos D. Paternina-Arboleda,et al.  Scheduling jobs on a k-stage flexible flow shop using a TOC-based (bottleneck) procedure , 2004, SIEDS 2004.

[20]  Ling Wang,et al.  A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation , 2014 .

[21]  Kuo-Ching Ying,et al.  Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm , 2012 .

[22]  Clare D. McGillem,et al.  A chaotic direct-sequence spread-spectrum communication system , 1994, IEEE Trans. Commun..

[23]  Xin-She Yang,et al.  Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan , 2014, Appl. Soft Comput..

[24]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[25]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[26]  Quan-Ke Pan,et al.  An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation , 2014, Inf. Sci..

[27]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[28]  Siba Sankar Mahapatra,et al.  Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems , 2018 .

[29]  Shih-Wei Lin,et al.  Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm , 2013, Comput. Oper. Res..

[30]  Shiwei Ma,et al.  A Quantum-Inspired Immune Algorithm for Hybrid Flow Shop with Makespan Criterion , 2009 .

[31]  Enrique Alba,et al.  HydroCM: A Hybrid Parallel Search Model for Heterogeneous Platforms , 2013, Hybrid Metaheuristics.

[32]  Rasaratnam Logendran,et al.  A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics , 2016 .

[33]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[34]  Shengyao Wang,et al.  An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines , 2013 .

[35]  Liang Gao,et al.  Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times , 2017, Appl. Math. Comput..

[36]  Victor Fernandez-Viagas,et al.  Design of a testbed for hybrid flow shop scheduling with identical machines , 2020, Comput. Ind. Eng..

[37]  Quan-Ke Pan,et al.  A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem , 2014, Appl. Soft Comput..

[38]  Han Hoogeveen,et al.  Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop , 2005, INFORMS J. Comput..

[39]  Mohamed Haouari,et al.  Bounding strategies for the hybrid flow shop scheduling problem , 2011, Appl. Math. Comput..

[40]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[41]  Victor Fernandez-Viagas,et al.  Efficient heuristics for the hybrid flow shop scheduling problem with missing operations , 2018, Comput. Ind. Eng..

[42]  Mehmet Fatih Tasgetiren,et al.  An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion , 2014, 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS).

[43]  Mostafa Zandieh,et al.  Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .

[44]  Xianpeng Wang,et al.  A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers , 2009, Comput. Oper. Res..

[45]  Liang Gao,et al.  An Improved Artificial Bee Colony algorithm for real-world hybrid flowshop rescheduling in Steelmaking-refining-Continuous Casting process , 2018, Comput. Ind. Eng..

[46]  Mostafa Zandieh,et al.  Algorithms for a realistic variant of flowshop scheduling , 2010, Comput. Oper. Res..

[47]  Victor Fernandez-Viagas,et al.  New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics , 2018, Expert Syst. Appl..

[48]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[49]  Ching-Jung Ting,et al.  Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem , 2018 .

[50]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[51]  K.-C. Ying,et al.  An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks , 2009, J. Oper. Res. Soc..

[52]  Caroline Gagné,et al.  Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times , 2018, Eur. J. Oper. Res..

[53]  Shih-Wei Lin,et al.  A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems , 2015 .