The ordinal optimisation of genetic control parameters for flow shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 23, Issue 11-12, 2004, Pages 812-819

  Wang, L ^a   Zhang, L ^a   Zheng, D Z ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Genetic algorithm; Optimal computing budget allocation; Ordinal optimisation; Scheduling; Stochastic optimisation

Indexed keywords

COMPUTER SIMULATION; FUZZY SETS; GENETIC ALGORITHMS; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; STOCHASTIC CONTROL SYSTEMS;

OPTIMAL COMPUTING BUDGET ALLOCATION; ORDINAL OPTIMIZATION; STOCHASTIC OPTIMIZATION;

PROBLEM SOLVING;

EID: 3142611385     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-002-1509-6     Document Type: Article

References (21)

1. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
2. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
3. max flowshop problem. Comput Operat Res 17(3):243-253
4. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Operat Res 22(1):5-13
5. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Europ J Oper Res 91:160-175
6. Wang L, Zheng DZ (2003) An effective hybrid heuristic for flow shop scheduling. Int J Adv Manuf Technol 21(1):38-44
7. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading
8. Wang L, Zheng DZ (2001) An effective hybrid optimization strategy for job shop scheduling problems. Comput Operat Res 28(6):585-596
9. Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evolut Comput 3(2):124-141
10. De Jong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. Dissertation, University of Michigan
11. Grefenstette JJ (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Sys Man Cybern 16(1):122-128
12. Pham QT (1995) Competitive evolution: a natural approach to operator selection. In: Yao X (ed) Progress in evolutionary computation, lecture notes in artificial intelligence, vol. 956. Springer, Berlin Heidelberg New York, pp 49-60
13. Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Sys Man Cybern 24(4):656-667
14. Ponnambalam SG, Jawahar N, Kumar BS (2002) Estimation of optimum genetic control parameters for job shop scheduling. Int J Adv Manuf Technol 19:224-234
15. Ho YC, Sreenivas R, Vakili P (1992) Ordinal optimization of discrete event dynamic systems. Discr Event Dynam Sys 2(2):61-88
16. Lee LH, Lau TWE, Ho YC (1999) Explanation of goal softening in ordinal optimization. IEEE Trans Automat Contr 44(1):94-99
17. Dai L (1996) Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems. J Optim Theory Appl 91(2):363-388
18. Chen CH, Lin J, Yucesan E, Chick SE (2000) Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discr Event Dynam Sys 10:251-270
19. Rudolph G (1994) Convergence properties of canonical genetic algorithms. IEEE Trans Neur Netwks 5(1):96-101
20. Eiben AE, Schoenauer M (2002) Evolutionary computing. Informat Process Lett 82:1-6
21. Caraffa V, lanes S, Bagchi TP, Sriskandarajah C (2001) Minimizing makespan in a blocking flowshop using genetic algorithms. Int J Prod Econ 70:101-115