Determining optimal combination of genetic operators for flow shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 30, Issue 3-4, 2006, Pages 302-308

  Wang, Ling ^a   Zhang, Liang ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Flow shop scheduling; Genetic algorithm; Genetic operators; Optimal combination; Ordinal optimisation

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; JOB ANALYSIS; MATHEMATICAL OPERATORS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION;

FLOW SHOP SCHEDULING; GENETIC OPERATORS; OPTIMAL COMBINATION; ORDINAL OPTIMIZATION;

SCHEDULING;

EID: 33746825131     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-0082-1     Document Type: Article

References (22)

1. Osman IH, Laporte G (1996) Meta-heuristics: a bibliography. Ann Oper Res 63:513-628
2. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading
3. Davis L (1991) Handbook of genetic algorithm. Van Nostrad, New York
4. Grefenstette JJ (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Syst Man Cybern 16(1):122-128
5. Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3 (2):124-141
6. De Jong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. Dissertation, University of Michigan
7. Pham QT (1995) Competitive evolution: a natural approach to operator selection. Lecture Notes Artif Intell 956:49-60
8. Srinivas M, Patnaik M (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern 24(4):656-667
9. Ponnambalam SG, Jawahar N, Kumar BS (2002) Estimation of optimum genetic control parameters for job shop scheduling. Int J Adv Manuf Technol 19(3):224-234
10. Esquivel SC, Ferrero SW, Gallard RH (2002) Parameter settings and representations in pareto-based optimization for job shop scheduling. Cybern Syst 33(6):559-578
11. Pongcharoen P, Hicks C, Braiden PM, Stewardson DJ (2002) Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products. Int J Prod Econ 78:311-322
12. Wang L, Zhang L, Zheng DZ (2004) The ordinal optimisation of genetic control parameters for flow shop scheduling. Int J Adv Manuf Technol 23:812-819
13. Ong YS, Keane AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2):99-110
14. Wang L, Zheng (2003) An effective hybrid heuristic for flow shop scheduling. Int J Adv Manuf Technol 21(1):38-44
15. Zhang L, Wang L, Zheng DZ (in press) An adaptive genetic algorithm with multiple operators for flow shop scheduling. Int J Adv Manuf Technol
16. Ho YC, Sreenivas R, Vakili P (1992) Ordinal optimization of discrete event dynamic systems. Discret Event Dyn Syst 2 (2):61-88
17. Chen CH, Lin J, Yucesan E, Chick SE (2000) Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discret Event Dyn Syst 10(3):251-270
18. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5-13
19. Eiben AE, Schoenauer M (2002) Evolutionary computing. Inf Process Lett 82:1-6
20. Dai L (1996) Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems. J Optim Theory Appl 91(2):363-388
21. Caraffa V, Ianes S, Bagchi TP, Sriskandarajah C (2001) Minimizing makespan in a blocking flowshop using genetic algorithms. Int J Prod Econ 70:101-115
22. Wang L, Zheng DZ (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Comput Oper Res 28(6):585-596