A systematic investigation of GA performance on jobshop scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1803, Issue , 2000, Pages 277-286

  Hart, Emma ^a   Ross, Peter ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; GENETIC PROGRAMMING; ROBOT PROGRAMMING; ROBOTICS; SCHEDULING; SIGNAL PROCESSING;

GENETIC ALGORITHM (GAS); JOB SHOP SCHEDULING PROBLEMS; OPTIMUM SOLUTION; PROBLEM DIFFICULTY; PROBLEM GENERATORS; REAL-WORLD SCHEDULING;

JOB SHOP SCHEDULING;

EID: 23044520147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45561-2_27     Document Type: Conference Paper

References (13)

1. http://www.dai.ed.ac.uk/_emmah/jobshop-expts.html.
2. Sugato Bagchi, Serdar Uckun, Yutaka Miyabe, and Kazuhiko Kawamura. Exploring problem-specific recombination operators for job shop scheduling. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 10-17. San Mateo: Morgan Kaufmann, 1991.
3. Brizuela C.A. and N. Sannomiya. A diversity study in genetic algorithms for jobshop. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 75-83, 1999.
4. L. Davis. Job shop scheduling with genetic algorithms. In J. J. Grefenstette, editor, Proceedings of the International Conference on Genetic Algorithms and their Applications, pages 136-140. San Mateo: Morgan Kaufmann, 1985.
5. B. Giffler and G.L. Thompson. Algorithm for solving production scheduling problems. Operations Research, 8(4):487-503, 1960.
6. E. Hart and P. Ross. A heuristic combination method for jobshop scheduling problems. In Parallel Problem Solving from Nature, PPSN-V, pages 845-854, 1998.
7. T. Hogg, A. Huberman, and C.P. Williams. Phase transitions and the search problem. Artificial Intelligence, 81(1-2):1-15, 1996.
8. S-C. Lin, E.D. Goodman, and W.F. Punch. A genetic algorithm approach to dynamic job-shop scheduling problems. In Thomas Bäck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 481-489. Morgan- Kaufmann, 1997.
9. R. Nakano and T. Yamada. Conventional genetic algorithms for job shop problems. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 474-479. San Mateo: Morgan Kaufmann, 1991.
10. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81(1-2):81-109, 1996.
11. P Ross, E Hart, and D Corne. Some observations about ga-based exam timetabling. In Practice and Theory of Automated Timetabling, pages 115-130, 1997.
12. B.M. Smith and M.E. Dyer. Locating the phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81(1-2):155-181, 1996.
13. P. Van Bael, D. Devogelaere, and M. Rijckaert. The job shop problem solved with simple, basis evolutionary search elements. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 665-670, 1999.