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

Applied Mathematics and Computation

Volumn 215, Issue 5, 2009, Pages 1984-1989

  Hsieh, Y C ^a   You, P S ^b   Liou, C D ^a  

^a NATIONAL FORMOSA UNIVERSITY   (Taiwan)

^b NATIONAL CHIAYI UNIVERSITY   (Taiwan)

Author keywords

Buffer; Flow shop; Immune algorithm

Indexed keywords

BENCH-MARK PROBLEMS; BUFFER; BUFFER SIZES; ENGINEERING FIELDS; FLOW SHOP; FLOW-SHOP SCHEDULING; HYBRID GENETIC ALGORITHMS; IMMUNE ALGORITHM; IMMUNE-BASED APPROACH; INFINITE BUFFER; MAKESPAN; NP-HARD PROBLEM; NUMERICAL RESULTS; RELATIVE ERRORS;

COMPUTATIONAL COMPLEXITY;

MACHINE SHOP PRACTICE;

EID: 70349866696     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.07.033     Document Type: Article

References (16)

1. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
2. Norman B.A. Scheduling flowshops with finite buffers and sequence-dependent setup times. Computers and Industrial Engineering 36 (1999) 163-177
3. Sawik T. Mixed integer programming for scheduling flexible lines with limited intermediate buffers. Mathematical and Computer Modeling 31 (2000) 39-52
4. Nawaz M., Enscore E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 1 (1983) 91-95
5. Ogbu F.A., and Smith D.K. The application of the simulated annealing algorithm to the solution of the n / m / Cmax flowshop problem. Computers and Operations Research 17 3 (1990) 243-253
6. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 1 (1995) 5-13
7. Thornton H.W., and Hunsucker J.L. A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. European Journal of Operational Research 152 (2004) 96-114
8. Leisten R. Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 28 (1990) 2085-2100
9. Nowicki E. The permutation flow shop with buffers: a tabu search approach. European Journal of Operational Research 116 (1999) 205-219
10. Brucker P., Heitmann S., and Hurink J. Flow-shop problems with intermediate buffers. OR Spectrum 25 (2003) 549-574
11. Wardono B., and Fathi Y. A tabu search algorithm for the multi-stage parallel machine problems with limited buffer capacities. European Journal of Operational Research 155 (2004) 380-401
12. Wang L., Zhang L., and Zheng D.Z. An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Computers and Operations Research 33 (2006) 2960-2971
13. Weissman I.L., and Cooper M.D. How the immune system develops. Scientific American 269 (1993) 33-40
14. Huang S.J. Enhancement of thermal unit commitment using immune algorithms based optimization approaches. Electrical Power and Energy Systems 21 (1999) 245-252
15. Michalewicz Z. Genetic Algorithm + Data Structures = Evolution Programs (1994), Springer-Verlag, New York
16. L.N. De Castro, F.J. Von Zuben, The clonal selection algorithm with engineering applications, in: Workshop Proceedings of the GECCO 2000, 2000, pp. 36-37.