Abstract
Although there has been a wealth of work reported in the literature on the application of genetic algorithms (GAs) to jobshop scheduling problems, much of it contains some gross over-generalisations, i.e that the observed performance of a GA on a small set of problems can be extrapolated to whole classes of other problems. In this work we present part of an ongoing investigation that aims to explore in depth the performance of one GA across a whole range of classes of jobshop scheduling problems, in order to try and characterise the strengths and weaknesses of the GA approach. To do this, we have designed a configurable problem generator which can generate problems of tunable difficulty, with a number of different features. We conclude that the GA tested is relatively robust over wide range of problems, in that it finds a reasonable solution to most of the problems most of the time, and is capable of finding the optimum solutions when run 3 or 4 times. This is promising for many real world scheduling applications, in which a reasonable solution that can be quickly produced is all that is required. The investigation also throws up some interesting trends in problem di_culty, worthy of further investigation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
http://www.dai.ed.ac.uk/~emmah/jobshop-expts.html.
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.
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.
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.
B. Giffler and G.L. Thompson. Algorithm for solving production scheduling problems. Operations Research, 8(4):487–503, 1960.
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.
T. Hogg, A. Huberman, and C.P. Williams. Phase transitions and the search problem. Artificial Intelligence, 81(1–2):1–15, 1996.
S-C. Lin, E.D. Goodman, and W.F. Punch. A genetic algorithm approach to dynamic job-shop scheduling problems. In Thomas Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 481–489. Morgan-Kaufmann, 1997.
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.
P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81(1–2):81–109, 1996.
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.
B.M. Smith and M.E. Dyer. Locating the phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81(1–2):155–181, 1996.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hart, E., Ross, P. (2000). A Systematic Investigation of GA Performance on Jobshop Scheduling Problems. In: Cagnoni, S. (eds) Real-World Applications of Evolutionary Computing. EvoWorkshops 2000. Lecture Notes in Computer Science, vol 1803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45561-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-45561-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67353-8
Online ISBN: 978-3-540-45561-5
eBook Packages: Springer Book Archive