A note of using effective immune based approach for the flow shop scheduling with buffers

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[3]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

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

[5]  I L Weissman,et al.  How the immune system develops. , 1993, Scientific American.

[6]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

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

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

[10]  Shyh-Jier Huang.  Enhancement of thermal unit commitment using immune algorithms based optimization approaches , 1999 .

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

[12]  Leandro Nunes de Castro,et al.  The Clonal Selection Algorithm with Engineering Applications 1 , 2000 .

[13]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

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

[15]  John L. Hunsucker,et al.  A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage , 2004, Eur. J. Oper. Res..

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

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