A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems

This paper proposes a novel hybrid discrete differential evolution (HDDE) algorithm for solving blocking flow shop scheduling problems to minimize the maximum completion time (i.e. makespan). Firstly, in the algorithm, the individuals are represented as discrete job permutations, and new mutation and crossover operators are developed for this representation, so that the algorithm can directly work in the discrete domain. Secondly, a local search algorithm based on insert neighborhood structure is embedded in the algorithm to balance the exploration and exploitation by enhancing the local searching ability. In addition, a speed-up method to evaluate insert neighborhood is developed to improve the efficiency of the whole algorithm. Computational simulations and comparisons based on the well-known benchmark instances of Taillard [Benchmarks for basic scheduling problems. European Journal of Operational Research 1993;64:278-285], by treating them as blocking flow shop problem instances with makespan criterion, are provided. It is shown that the proposed HDDE algorithm not only generates better results than the existing tabu search (TS) and TS with multi-moves (TS+M) approaches proposed by Grabowski and Pempera [The permutation flow shop problem with blocking. A tabu search approach 2007;35:302-311], but also outperforms the hybrid differential evolution (HDE) algorithm developed by Qian et al. [An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers and operations research 2009;36(1):209-233] in terms of solution quality, robustness and search efficiency. Ultimately, 112 out of 120 best known solutions provided by Grabowski and Pempera [The permutation flow shop problem with blocking. A tabu search approach 2007;35:302-311] and Ronconi [A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research 2005;138(1):53-65] are further improved by the proposed HDDE algorithm.

[1]  B. Růžek,et al.  Differential Evolution Algorithm in the Earthquake Hypocenter Location , 2001 .

[2]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[3]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[4]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[5]  Joni-Kristian Kämäräinen,et al.  Differential Evolution Training Algorithm for Feed-Forward Neural Networks , 2003, Neural Processing Letters.

[6]  Ling Wang,et al.  No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm , 2008 .

[7]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[8]  Débora P. Ronconi,et al.  Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[9]  Chyi Hwang,et al.  Design of Digital PID Controllers for Continuous-Time Plants with Integral Performance Criteria , 2004 .

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

[11]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[12]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[13]  Yun-Chia Liang,et al.  A Particle Swarm Optimization and Differential Evolution Algorithms for Job Shop Scheduling Problem , 2006 .

[14]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[15]  Czesław Smutnicki,et al.  A two-machine permutation flow shop scheduling problem with buffers , 1998 .

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

[17]  A. Kai Qin,et al.  Evolutionary extreme learning machine , 2005, Pattern Recognit..

[18]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[19]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .

[20]  É. Taillard Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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

[22]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[23]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[24]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[25]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[26]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

[27]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[28]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[29]  Ling Wang,et al.  A hybrid differential evolution method for permutation flow-shop scheduling , 2008 .

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

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

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

[33]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[34]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[35]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

[36]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[37]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the generalized traveling salesman problem , 2007, GECCO '07.