An adaptive genetic algorithm with multiple operators for flowshop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 27, Issue 5-6, 2006, Pages 580-587

  Zhang, Liang ^a   Wang, Ling ^a   Zheng, Da Zhong ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Adaptive control of operator; Flowshop scheduling; Genetic algorithm; Multiple operators

Indexed keywords

ADAPTIVE CONTROL SYSTEMS; INDUSTRIAL MANAGEMENT; MANUFACTURE; PERFORMANCE;

FLOWSHOP SCHEDULING; MULTIPLE OPERATORS;

GENETIC ALGORITHMS;

EID: 28544438774     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-004-2223-3     Document Type: Article

References (26)

1. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
2. Pinedo M (1995) Scheduling theory, algorithms, and systems. Prentice-Hall, New York
3. Baker KR. Introduction to sequencing and scheduling. Wiley, New York
4. Nawaz M, Enscore E, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 (1):91-95
5. Koulamas C (1998) A new constructive heuristic for the flowshop scheduling problem. Eur J Oper Res 105:66-71
6. max flowshop problem. Comput Oper Res 17(3):243-253
7. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5-13
8. Wang L, Zhang L, Zheng DZ (2003) A class of order-based genetic algorithm for flowshop scheduling. Int J Adv Manuf Technol 22(11-12):828-835
9. Iyer SK, Saxenab B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31:593-606
10. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91:160-175
11. Wang L, Zheng DZ (2003) A modified evolutionary programming for flowshop scheduling. Int J Adv Manuf Technol 22(7-8):522-527
12. Ying KC, Liao CJ (2004) An ant colony system for permutation flowshop sequencing. Comput Oper Res 31:791-801
13. Wang L, Zheng DZ (2003) An effective hybrid heuristic for flowshop scheduling, Int J Adv Manuf Technol 21(1):38-44
14. Wang L (2001) Intelligent optimization with applications. Tsinghua University Press, Beijing
15. Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, Berlin Heidelberg New York
16. Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3(2): 124-141
17. Wang L, Zheng DZ (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Comput Oper Res 28(6):585-596
18. Grefenstette JJ (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Syst Man Cybern 16(1):122-128
19. Wang L, Zhang L, Zheng DZ (2004) The Ordinal optimisation of genetic control parameters for flowshop scheduling. Int J Adv Manuf Technol 23(11-12):812-819
20. Coello CCA (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113-127
21. Lee LH. Fan YL (2002) An adaptive real-coded genetic algorithm. Appl Artif Intell 46:457-486
22. Hong TP, Wang MS, Chen WC (2002) Simultaneously applying multiple mutation operators in genetic algorithms. J Heuristic 6:439-455
23. Croce FD, Tadei R, Volta G (1995) A genetic algorithm for the job shop problem. Comput Oper Res 22(1):15-24
24. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning, Addison-Wesley, Boston
25. Bac FQ, Perov VL (1993) New evolutionary genetic algorithms for NP-complete combinatorial optimization problems. Biological Cybern 69:229-234
26. Carlier J (1978) Ordonnancements a contraintes disjonctives. RAIRO Recherche operationelle/Oper Res 12:333-351