A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem

Distributed assembly permutation flow-shop scheduling problem (DAPFSP) is recognized as an important class of problems in modern supply chains and manufacturing systems. In this paper, a backtracking search hyper-heuristic (BS-HH) algorithm is proposed to solve the DAPFSP. In the BS-HH scheme, ten simple and effective heuristic rules are designed to construct a set of low-level heuristics (LLHs), and the backtracking search algorithm is employed as the high-level strategy to manipulate the LLHs to operate on the solution space. Additionally, an efficient solution encoding and decoding scheme is proposed to generate a feasible schedule. The effectiveness of the BS-HH is evaluated on two typical benchmark sets and the computational results indicate the superiority of the proposed BS-HH scheme over the state-of-the-art algorithms.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  Reza Tavakkoli-Moghaddam,et al.  Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan , 2010, Knowl. Based Syst..

[3]  Mengjie Zhang,et al.  Automated Design of Production Scheduling Heuristics: A Review , 2016, IEEE Transactions on Evolutionary Computation.

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

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

[6]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

[7]  Liang Gao,et al.  Backtracking Search Algorithm with three constraint handling methods for constrained optimization problems , 2015, Expert Syst. Appl..

[8]  Bo Liu,et al.  Scheduling of stochastic distributed assembly flowshop under complex constraints , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[9]  Konstantinos P. Anagnostopoulos,et al.  A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem , 2014, Inf. Sci..

[10]  Victor Fernandez-Viagas,et al.  On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem , 2014, Comput. Oper. Res..

[12]  Aniruddha Bhattacharya,et al.  Backtracking search optimization based economic environmental power dispatch problems , 2015 .

[13]  Sun Hur,et al.  Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain , 2002 .

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

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

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

[17]  Pei-Chann Chang,et al.  A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems , 2011 .

[18]  Chin-Chia Wu,et al.  An improved memetic algorithm based on a dynamic neighbourhood for the permutation flowshop scheduling problem , 2014 .

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

[20]  Sai Ho Chung,et al.  An adaptive genetic algorithm with dominated genes for distributed scheduling problems , 2005, Expert Syst. Appl..

[21]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

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

[23]  Hsi-Yung Feng,et al.  An Effective Approach for Distributed Process Planning Enabled by Event-driven Function Blocks , 2007 .

[24]  Seyyed M. T. Fatemi Ghomi,et al.  A survey of multi-factory scheduling , 2016, J. Intell. Manuf..

[25]  Sancho Salcedo-Sanz,et al.  An evolutionary-based hyper-heuristic approach for optimal construction of group method of data handling networks , 2013, Inf. Sci..

[26]  Shouyang Wang,et al.  Scheduling of no-wait stochastic distributed assembly flowshop by hybrid PSO , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[27]  Mehmet Fatih Tasgetiren,et al.  Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion , 2015, Comput. Ind. Eng..

[28]  Licheng Jiao,et al.  A two-phase knowledge based hyper-heuristic scheduling algorithm in cellular system , 2015, Knowl. Based Syst..

[29]  Pei-Chann Chang,et al.  Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems , 2012, Comput. Ind. Eng..

[30]  Jian Lin,et al.  Oppositional backtracking search optimization algorithm for parameter identification of hyperchaotic systems , 2015 .

[31]  Quan-Ke Pan,et al.  An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time , 2016, Expert Syst. Appl..

[32]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[33]  Pinar Çivicioglu,et al.  Backtracking Search Optimization Algorithm for numerical optimization problems , 2013, Appl. Math. Comput..

[34]  Mostafa Modiri-Delshad,et al.  Backtracking search algorithm for solving economic dispatch problems with valve-point effects and multiple fuel options , 2016 .

[35]  Patrick Siarry,et al.  Biogeography-based optimization for constrained optimization problems , 2012, Comput. Oper. Res..

[36]  Sancho Salcedo-Sanz,et al.  An evolutionary-based hyper-heuristic approach for the Jawbreaker puzzle , 2013, Applied Intelligence.

[37]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[38]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[39]  K. Anwar,et al.  Harmony Search-based Hyper-heuristic for examination timetabling , 2013, 2013 IEEE 9th International Colloquium on Signal Processing and its Applications.

[40]  Mehmet Fatih Tasgetiren,et al.  Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion , 2016, Knowl. Based Syst..

[41]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[42]  Inderveer Chana,et al.  Bacterial foraging based hyper-heuristic for resource scheduling in grid computing , 2013, Future Gener. Comput. Syst..

[43]  Long Wen,et al.  A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption , 2017 .

[44]  Yan-Feng Liu,et al.  A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem , 2013, Appl. Soft Comput..

[45]  Wei-Hsiu Huang,et al.  A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem , 2013 .

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

[47]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.