Scheduling flow shops with blocking using a discrete self-organising migrating algorithm

A novel approach of a discrete self-organising migrating algorithm is introduced to solve the flowshop with blocking scheduling problem. New sampling routines have been developed that propagate the space between solutions in order to drive the algorithm. The two benchmark problem sets of Carlier, Heller, Reeves and Taillard are solved using the new algorithm. The algorithm compares favourably with the published algorithms Differential Evolution, Tabu Search, Genetic Algorithms and their hybrid variants. A number of new upper bounds are obtained for the Taillard problem sets.

[1]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

[2]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

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

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

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

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

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

[8]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

[10]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

[11]  P. Aravindan,et al.  Constructive and improvement flow shop scheduling heuristics: An extensive evaluation , 2001 .

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

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

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

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

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

[17]  Ching-Jong Liao,et al.  A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks , 2008 .

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

[19]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[20]  M. F. Tasgetiren,et al.  A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion , 2011 .

[21]  Appa Iyer Sivakumar,et al.  Optimisation of flow-shop scheduling with batch processor and limited buffer , 2012 .

[22]  T. Elmekkawy,et al.  A meta-heuristic approach for solving the no-wait flow-shop problem , 2012 .

[23]  Rubén Ruiz,et al.  Flow shop rescheduling under different types of disruption , 2013 .

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