A comparison of messy GA and permutation based GA for job shop scheduling

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1593-1594

  Fenton, Pio ^a   Walsh, Paul ^a  

^a Department of Chemistry   (Ireland)

Author keywords

Job Shop Scheduling; Messy Genetic Algorithms; Repeating Permutation Representation

Indexed keywords

SCHEDULING;

JOB SHOP SCHEDULING; MESSY GENETIC ALGORITHM; REPEATING PERMUTATION REPRESENTATION;

GENETIC ALGORITHMS;

EID: 32544460633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068275     Document Type: Conference Paper

References (5)

1. www.lancet.mit.edu/ga (accessed 10-January-2005)
2. Dirk Christian Mattfeld, "Evolutionary Search and the Job-Shop: Investigations on Genetic Algorithms for Production Scheduling" 1995 Spinger- Verlag
3. Dimitri Knjazew "OmeGa: A competent Genetic Algorithm for Solving Permutation and Scheduling Problems" 2001, Kluwer Academic Press.
4. Muth, J. F. and Thompson, G. L., eds., Industrial Scheduling, Englewood Cliffs, N. J.: Prentice-Hall, Inc., 1963.
5. ta01-ta80 are from É. D. Taillard (1993), "Benchmarks for basic scheduling problems ", European Journal of Operational Research 64, Pages 278-28