A Differential Evolution Approach for NTJ-NFSSP with SDSTs and RDs

In this paper, an efficient differential evolution approach, namely DE_NTJ, is presented to minimize the number of tardy jobs (NTJ) for the no-wait flow-shop scheduling problem (NFSSP) with sequence-dependent setup times (SDSTs) and release dates (RDs), which is a complex problem and can be abbreviated as NTJ-NFSSP with SDSTs and RDs. To balance the exploration and exploitation abilities of our DE_NTJ, DE-based global search is utilized to obtain the promising regions or solutions over the solution space, and a local search based on the interchange-based neighborhood and problem's properties is developed to exploit the neighborhoods from these regions. Simulation results based on a set of random instances show the superiority of DE_NTJ in terms of searching quality, efficiency, and robustness.

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

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

[3]  Mehmet Fatih Tasgetiren,et al.  Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.

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

[5]  Yong Gan,et al.  Advanced Intelligent Computing , 2011, Lecture Notes in Computer Science.

[6]  Han Hoogeveen,et al.  Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..

[7]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

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

[9]  Rong Hu,et al.  Hybrid Differential Evolution Optimization for No-Wait Flow-Shop Scheduling with Sequence-Dependent Setup Times and Release Dates , 2011, ICIC.

[10]  Andreas C. Nearchou,et al.  A differential evolution approach for the common due date early/tardy job scheduling problem , 2008, Comput. Oper. Res..

[11]  L. Wang,et al.  A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..

[12]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

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

[14]  Cheng Wu,et al.  A simulated annealing algorithm for single machine scheduling problems with family setups , 2009, Comput. Oper. Res..

[15]  Mehmet Sevkli,et al.  Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion , 2004 .