An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

[1]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[2]  Bo Liu,et al.  Directing orbits of chaotic systems by particle swarm optimization , 2006 .

[3]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[5]  Bo Liu,et al.  Improved particle swarm optimization combined with chaos , 2005 .

[6]  Michel Gourgand,et al.  Markovian analysis for performance evaluation and scheduling in m , 2005, Eur. J. Oper. Res..

[7]  Ameur Soukhal,et al.  Complexity of flow shop scheduling problems with transportation constraints , 2005, Eur. J. Oper. Res..

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

[9]  Yahya Fathi,et al.  Abstract Discrete Optimization , 2000 .

[10]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[11]  Marco Pranzo,et al.  Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times , 2004, Eur. J. Oper. Res..

[12]  Peter Brucker,et al.  Flow-shop problems with intermediate buffers , 2003, OR Spectr..

[13]  Ling Wang,et al.  A class of order-based genetic algorithm for flow shop scheduling , 2003 .

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

[15]  T. Sawik.  An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers , 2002 .

[16]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[17]  J. Grabowski,et al.  New block properties for the permutation flow shop problem with application in tabu search , 2001, J. Oper. Res. Soc..

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

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

[20]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[21]  Alessandro Agnetis,et al.  An exact algorithm for the batch sequencing problem in a two‐machine flow shop with limited buffer , 1998 .

[22]  Riyaz Sikora,et al.  A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line , 1996 .

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

[24]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[25]  H. Sarper,et al.  Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop , 1996 .

[26]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

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

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

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

[30]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[31]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

[32]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[33]  S. S. Reddi,et al.  Note---Sequencing with Finite Intermediate Storage , 1976 .

[34]  Sujit K. Dutta,et al.  Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage , 1975 .

[35]  B. Norman.  Scheduling flowshops with finite buffers and sequence-dependent setup times , 1999 .

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

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

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