Skip to main content
SpringerLink
Log in

Production scheduling and genetic algorithms

  • Chapter
  • First Online:
Information Management in Computer Integrated Manufacturing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 973))

Abstract

This treatise deals with the applicability of genetic algorithms to the area of production scheduling. To begin with, an introduction to the principles of genetic algorithms is given. After having outlined a standard genetic algorithm, first approaches to the traveling salesman problem are explained. On this basis, a survey on several approaches to different production scheduling problems is given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sugato Bagchi, Serda Uckun, Yutaka Miyabe, and Kazuhiko Kawamura. Exploring problem-specific recombination operators for job shop scheduling. In Belew and Booker [3], pages 10–17.

    Google Scholar 

  2. Kenneth R. Baker. Introduction to Sequencing and Scheduling. John Wiley & Sons, 1974.

    Google Scholar 

  3. Richard K. Belew and Lashon B. Booker, editors. Proceedings of the Third International Conference on Genetic Algorithms. University of California, San Diego, Morgan Kaufmann, July 13–16 1991.

    Google Scholar 

  4. John E. Biegel and James J. Davern. Genetic algorithms and job shop scheduling. Computer Industrial Engineering, 19:81–91, 1–4 1990.

    Google Scholar 

  5. J. Blazewicz, K. Ecker, G. Schmidt, and J. Weglarz. Scheduling in Computer and Manufacturing Systems. Springer-Verlag, 1993.

    Google Scholar 

  6. Ralf Bruns. Incorporation of a knowledge-based scheduling system into a genetic algorithm. In W. Görke, H. Rininsland, and M. Syrbe, editors, Information als Produktionsfaktor, pages 547–553. Springer Verlag, 1992.

    Google Scholar 

  7. Ralf Bruns. Direct chromosome representation and advanced genetic operators. In Stephanie Forrest, editor, Proceedings of the fifth International Conference on Genetic Algorithms, pages 352–359. Morgan Kaufmann, 17–21 July 1993.

    Google Scholar 

  8. Gary A. Cleveland and Stephen F. Smith. Using genetic algorithms to schedule flow shop releases. In Schaffer [29], pages 160–169.

    Google Scholar 

  9. Lawrence Davis. Job shop scheduling with genetic algorithms. In Grefenstette [18], pages 136–140.

    Google Scholar 

  10. Ulrich Dorndorf and Erwin Pesch. Evolution based learning in a job shop environment. Computers & Operations Research, 1992.

    Google Scholar 

  11. Gunter Dueck, Tobias Scheuer, and Hans-Martin Wallmeier. Toleranzschwelle und Sintflut: neue Ideen zur Optimierung. Spektrum der Wissenschaft, pages 42–51, 1993.

    Google Scholar 

  12. M. R. Gary and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, 1979.

    Google Scholar 

  13. B. Giffler and G. L. Thompson. Algorithms for solving production-schedule problems. Operations Research, 8:487–503, 1960.

    Google Scholar 

  14. David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.

    Google Scholar 

  15. David E. Goldberg and Robert Lingle. Alleles, loci, and the traveling salesman problem. In Grefenstette [18], pages 154–159.

    Google Scholar 

  16. J.J. Grefenstette. Incorporating problem specific knowledge into genetic algorithms. 1987.

    Google Scholar 

  17. John Grefenstette, Rajeev Gopal, Brian Rosmaita, and Dirk Van Gucht. Genetic algorithms for the traveling salesman problem. In Grefenstette [18], pages 160–168.

    Google Scholar 

  18. John J. Grefenstette, editor. Proceedings of the First International Conference on Genetic Algorithms and Their Applications. Carnegie Mellon University, Pittsburgh, Lawrence Erlbaum Associates, July 24–26 1985.

    Google Scholar 

  19. John J. Grefenstette, editor. Proceedings of the Second International Conference on Genetic Algorithms and Their Applications. Massachusetts Institute of Technology, Cambridge, MA, Lawrence Erlbaum Associates, 28–31 July 1987.

    Google Scholar 

  20. M. R. Hilliard, G. E. Liepins, Mark Palmer, and Michael Morrow. Greedy genetics. In Grefenstette [19], pages 90–99.

    Google Scholar 

  21. John H. Holland. Adaption in Natural and Artificial Systems. University of Michigan Press, 1975.

    Google Scholar 

  22. S. Lin and B. W. Kerningham. An effictive heuristic algorithm for the traveling salesman problem. Operations Research, pages 498–516, 1972.

    Google Scholar 

  23. Zbigniew Michalewicz. A hierarchy of evolution programs: An experimental study. Evolutionary Computation, 1(1):51–76, 1993.

    Google Scholar 

  24. Ryohei Nakano and Takeshi Yamada. Conventional genetic algorithm for job shop problems. In Belew and Booker [3], pages 474–479.

    Google Scholar 

  25. Ryohei Nakano and Takeshi Yamada. Parallel Problem Solving from Nature, chapter A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems, pages 281–291. Elsevier Science Publishers B.V., 1992.

    Google Scholar 

  26. I. M. Oliver, D. J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the traveling salesman problem. In Grefenstette [19], pages 224–230.

    Google Scholar 

  27. S. S. Panwalkar and W. Iskander. A survey of scheduling rules. Operations Research, pages 45–61, 1977.

    Google Scholar 

  28. Ingo Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog Verlag, 1973.

    Google Scholar 

  29. J. David Schaffer, editor. Proceedings of the Third International Conference on Genetic Algorithms. George Mason University, Arlington, VA, Morgan Kaufmann, June 4–7 1989.

    Google Scholar 

  30. Hans-Paul Schwefel. Numerical Optimization for Computer Models. Wiley, 1981.

    Google Scholar 

  31. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. A comparision of genetic sequencing operators. In Belew and Booker [3], pages 69–76.

    Google Scholar 

  32. T. Starkweather, D. Whitley, K. Mathias, and S. McDaniel. Sequence scheduling with genetics algorithms. In Günter Fandel, Thomas Gulledge, and Albert Jones, editors, New Directions for Operations Research in Manufacturing. Proceedings of a Joint US/German Conference, pages 129–148. Operations Research Society of America (ORSA), Deutsche Gesellschaft für Operations Research (DGOR), Springer Berlin, 1992.

    Google Scholar 

  33. Jung Y. Suh and Dirk Van Gucht. Incorporating heuristic information into genetic search. In Grefenstette [19], pages 100–107.

    Google Scholar 

  34. Gilbert Syswerda. Schedule optimization using genetic algorithms. In Handbook of Genetic Algorithms, pages 332–349. Van Nostrand Reinhold, 1991.

    Google Scholar 

  35. D. Whitley, T. Starkweather, and D. Fuquay. Scheduling problems and the traveling salesmen: the genetic edge recombination operator. In Schaffer [29], pages 133–140.

    Google Scholar 

  36. D. Whitley, T. Starkweather, and D. Shaner. Using simulations with genetic algorithms for optimizing schedules. In B. Svrcek and J. McRae, editors, Proceedings of the 1990 Computer Simulation Conference, pages 288–293. SCS, San Diego, CA, 16–18 July 1990.

    Google Scholar 

  37. Darrel Whitley, Timothy Starkweather, and Daniel Shaner. The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In Lawrence Davis, editor, Handbook of Genetic Algorithms, chapter 22, pages 350–372. Van Nostrand Reinhold, New York, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wirtschaftsinformatik der Produktionsunternehmen, Universität Gesamthochschule Essen, Germany

    Michael Neubauer

Authors
  1. Michael Neubauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heimo H. Adelsberger Jiří Lažanský Vladimír Mařík

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Neubauer, M. (1995). Production scheduling and genetic algorithms. In: Adelsberger, H.H., Lažanský, J., Mařík, V. (eds) Information Management in Computer Integrated Manufacturing. Lecture Notes in Computer Science, vol 973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60286-0_120

Download citation

  • DOI: https://doi.org/10.1007/3-540-60286-0_120

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60286-6

  • Online ISBN: 978-3-540-44785-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation