Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem

Abstract Distributed permutation flowshop scheduling problem (DPFSP) has become a very active research area in recent years. However, minimizing total flowtime in DPFSP, a very relevant and meaningful objective for today's dynamic manufacturing environment, has not captured much attention so far. In this paper, we address the DPFSP with total flowtime criterion. To suit the needs of different CPU time demands and solution quality, we present three constructive heuristics and four metaheuristics. The constructive heuristics are based on the well-known LR and NEH heuristics. The metaheuristics are based on the high-performing frameworks of discrete artificial bee colony, scatter search, iterated local search, and iterated greedy, which have been applied with great success to closely related scheduling problems. We explore the problem-specific knowledge and accelerations to evaluate neighboring solutions for the considered problem. We introduce advanced and effective technologies like a referenced local search, a strategy to escape from local optima, and an enhanced intensive search method for the presented metaheuristics. A comprehensive computational campaign against the closely related and well performing algorithms in the literature is carried out. The results show that both the presented constructive heuristics and metaheuristics are very effective for solving the DPFSP with total flowtime criterion.

[1]  J. Framiñan,et al.  A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem , 2015 .

[2]  Quan-Ke Pan,et al.  Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows , 2017, Comput. Oper. Res..

[3]  Liang Gao,et al.  A Discrete Electromagnetism-Like Mechanism Algorithm for Solving Distributed Permutation Flowshop Scheduling Problem , 2010, 2010 International Conference on Manufacturing Automation.

[4]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

[5]  Manoj Kumar Tiwari,et al.  Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach , 2006 .

[6]  Victor Fernandez-Viagas,et al.  The distributed permutation flow shop to minimise the total flowtime , 2018, Comput. Ind. Eng..

[7]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

[8]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[9]  Ling Wang,et al.  A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem , 2017, Swarm and Evolutionary Computation.

[10]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[11]  Quan-Ke Pan,et al.  An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling , 2016, Eur. J. Oper. Res..

[12]  Quan-Ke Pan,et al.  Iterated Greedy methods for the distributed permutation flowshop scheduling problem , 2019, Omega.

[13]  Frank L. Lewis,et al.  Data-Based Multiobjective Plant-Wide Performance Optimization of Industrial Processes Under Dynamic Environments , 2016, IEEE Transactions on Industrial Informatics.

[14]  Xingsheng Gu,et al.  An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems , 2015, Neurocomputing.

[15]  Chao Lu,et al.  An Effective Multiobjective Algorithm for Energy-Efficient Scheduling in a Real-Life Welding Shop , 2018, IEEE Transactions on Industrial Informatics.

[16]  Shih-Wei Lin,et al.  Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems , 2017, Comput. Ind. Eng..

[17]  Rubén Ruiz,et al.  The distributed permutation flowshop scheduling problem , 2010, Comput. Oper. Res..

[18]  Rubén Ruiz,et al.  Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem , 2010 .

[19]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[20]  Quan-Ke Pan,et al.  A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion , 2013 .

[21]  Jun Fu,et al.  Global finite-time stabilization of a class of switched nonlinear systems with the powers of positive odd rational numbers , 2015, Autom..

[22]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

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

[24]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

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

[26]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

[27]  Quan-Ke Pan,et al.  An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem , 2014 .

[28]  Victor Fernandez-Viagas,et al.  A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation , 2017, Eur. J. Oper. Res..

[29]  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..

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

[31]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

[32]  Rong Chen,et al.  A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem , 2011, Int. J. Comput. Intell. Syst..

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

[34]  Jian Gao,et al.  An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem , 2013 .

[35]  Jian-Jun Wang,et al.  Single-machine scheduling problems with precedence constraints and simple linear deterioration , 2015 .

[36]  M. Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities , 2014 .

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

[38]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[39]  Quan-Ke Pan,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[40]  Surendra M. Gupta,et al.  Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm , 2015 .

[41]  Ling Wang,et al.  An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem , 2014 .

[42]  Rubén Ruiz,et al.  A scatter search algorithm for the distributed permutation flowshop scheduling problem , 2014, Eur. J. Oper. Res..

[43]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[44]  You-Lian Zheng,et al.  Hybrid flow shop scheduling with assembly operations and key objectives: A novel neighborhood search , 2017, 2018 Chinese Control And Decision Conference (CCDC).

[45]  Shih-Wei Lin,et al.  Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm , 2013 .

[46]  Jose M. Framiñan,et al.  Manufacturing Scheduling Systems - An Integrated View on Models, Methods and Tools , 2014 .

[47]  Andrew Y. C. Nee,et al.  Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems , 2007, Comput. Ind. Eng..

[48]  Peiyong Duan,et al.  An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system , 2019, Int. J. Prod. Res..

[49]  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..

[50]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..

[51]  Victor Fernandez-Viagas,et al.  A new set of high-performing heuristics to minimise flowtime in permutation flowshops , 2015, Comput. Oper. Res..

[52]  Ling Wang,et al.  An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem , 2013 .

[53]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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