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

Pio Fenton, Paul Walsh. A comparison of messy GA and permutation based GA for job shop scheduling. In Hans-Georg Beyer, Una-May O Reilly, editors, Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005. pages 1593-1594, ACM, 2005. [doi]

@inproceedings{FentonW05:0,
  title = {A comparison of messy GA and permutation based GA for job shop scheduling},
  author = {Pio Fenton and Paul Walsh},
  year = {2005},
  doi = {10.1145/1068009.1068275},
  url = {http://doi.acm.org/10.1145/1068009.1068275},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/FentonW05%3A0},
  cites = {0},
  citedby = {0},
  pages = {1593-1594},
  booktitle = {Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005},
  editor = {Hans-Georg Beyer and Una-May O Reilly},
  publisher = {ACM},
  isbn = {1-59593-010-8},
}