An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem

Abstract This paper considers a distributed assembly permutation flowshop scheduling problem (DAPFSP) with total flowtime (TF) criterion, which is of great significance to both industry and research community. We propose an improved iterative greedy algorithm based on the groupthink (gIGA) for solving the problem. Firstly, based on the solution representation, we present an effective initialization procedure by combining the well-known NEH heuristic and Palmer method. Secondly, in order to improve the efficiency of the algorithm, both the destruction reconstruction process and the local search process are elaborately designed for the products and jobs separately. Next, our algorithm adaptively extracts jobs in the destruction stage with regard to the size of instances. In addition, we employ a novel selection method that is based on the objective values and the ages of the individuals in the population. Through a total of 810 benchmark instances, the proposed algorithm is compared with seven state-of-the-art algorithms in the literature. The experimental results show that the proposed algorithm performs significantly better than the other algorithms in comparison by three analytical methods for solving the DAPFSP with TF criterion.

[1]  Ling Wang,et al.  A distributed permutation flowshop scheduling problem with the customer order constraint , 2019, Knowl. Based Syst..

[2]  Ping Wang,et al.  Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion , 2019, Swarm Evol. Comput..

[3]  Dechang Pi,et al.  Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms , 2017, Knowl. Based Syst..

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

[5]  Quan-Ke Pan,et al.  An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times , 2020, Swarm Evol. Comput..

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

[7]  Jose M. Framiñan,et al.  Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem , 2019, Appl. Soft Comput..

[8]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[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.  Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times , 2021, Eng. Appl. Artif. Intell..

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

[13]  Daniele Ferone,et al.  A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times , 2017, Simul. Model. Pract. Theory.

[14]  Sara Hatami,et al.  The Distributed Assembly Permutation Flowshop Scheduling Problem , 2013 .

[15]  Fuqing Zhao,et al.  An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion , 2020, Expert Syst. Appl..

[16]  Daniel Merkle,et al.  An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.

[17]  Shengyao Wang,et al.  A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem , 2016 .

[18]  Jian Lin,et al.  An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem , 2016, Comput. Ind. Eng..

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

[20]  Ying Tan,et al.  Improving Metaheuristic Algorithms With Information Feedback Models , 2019, IEEE Transactions on Cybernetics.

[21]  D. S. Palmer Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[22]  Zhigang Xu,et al.  The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery , 2020, Int. J. Prod. Res..

[23]  Feng Cao,et al.  Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion , 2018, Eng. Appl. Artif. Intell..

[24]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

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

[26]  Quan-Ke Pan,et al.  An effective Iterated Greedy algorithm for the distributed permutation flowshop scheduling with due windows , 2020, Appl. Soft Comput..

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

[28]  Shengyao Wang,et al.  An Estimation of Distribution Algorithm-Based Memetic Algorithm for the Distributed Assembly Permutation Flow-Shop Scheduling Problem , 2016, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[29]  Ling Wang,et al.  A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem , 2017, Swarm Evol. Comput..

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

[31]  Quan-Ke Pan,et al.  An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop , 2020, Expert Syst. Appl..

[32]  Zhenxue He,et al.  Memetic Algorithm With Meta-Lamarckian Learning and Simplex Search for Distributed Flexible Assembly Permutation Flowshop Scheduling Problem , 2020, IEEE Access.

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

[34]  Ke Liu,et al.  Multi-objective Optimization of the Distributed Permutation Flow Shop Scheduling Problem with Transportation and Eligibility Constraints , 2018 .

[35]  M. Fatih Tasgetiren,et al.  An energy-efficient permutation flowshop scheduling problem , 2020, Expert Syst. Appl..

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