An improved genetic algorithm for flow shop sequencing

Proceedings of 2005 International Conference on Neural Networks and Brain Proceedings, ICNNB'05

Volumn 1, Issue , 2005, Pages 521-524

  Haichang, Gao ^a   Boqin, Feng ^a   Li, Zhu ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); MATHEMATICAL OPERATORS; PRODUCTION ENGINEERING; SCHEDULING;

FLOW SHOP SEQUENCING; GENETIC OPERATORS; OPTIMIZATION PROBLEMS; SCHEDULING PROBLEMS;

GENETIC ALGORITHMS;

EID: 33847172307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. M. R. Garey, D. S. Johnson, R. Sethi, "The complexity of flow shop and job shop scheduleing," Mathematics of Operations Research, Vol 1, no 2, pp117-129, 1976
2. E. Tailland, "Some efficient heuristic methods for the flow shop sequencing problems," European Journal of Operational Research, Vol 47, no 3, pp65-74, 1990
3. H. Holland, Adaptation in natural and artificial system, University of Michigan Press, Ann Arbor, Michigan, 1975
4. Wang Ling, Intelligent optimization algorithms with applications, Tsinghua University Press, Bejing, 2001
5. D. Berndt, J. Fisher, L. Johnson, "Breeding software test cases with genetic algorithms," HICSS'03, 2003
6. M. Srnivas, L. M. Patnaik, "Adaptive probability of crossover and mutation in genetic algorithms," IEEE Trans on SMC, vol 24, no 2, pp656-667,1994
7. E. Tailland, "Benchmark for basic scheduling problems," European Journal of Operational Research, Vol 64, no 2, pp278-285, 1993
8. I. H. Osman, C. N. Potis, "Simulated annealing for permutation flow shop scheduling," The int. J. of Mgmt Sci. Vol 17, no 6, pp551-557, 1989
9. C. R. Reeves, "A genetic algorithms for flow shop sequencing," Computers & Operations Research. Vol 22, no 4, pp5-13, 1995