Skip to main content
SpringerLink
Log in

Practical Issues and Recent Advances in Job- and Open-Shop Scheduling

  • Chapter
Evolutionary Algorithms in Engineering Applications

Summary

The chief advantage of evolutionary techniques in scheduling is the ability to provide good solutions to awkward problems with fast development time. There are still various issues and challenges that arise from the need to deal with the complexities of real-world problems rather than abstract ‘academic’ problems. This chapter reviews techniques and progress to date, and highlights what we believe to be important challenges and directions for future progress.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 189.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2):149–156, Spring 1991.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  3. K. Baker. Introduction to Sequencing and Scheduling. John Wiley and Sons, Inc., 1974.

    Google Scholar 

  4. J. Biethahn and V. Nissen. Evolutionary Algorithms in Management Applications. Snringer-Verlag. Berlin. 1995.

    Book  MATH  Google Scholar 

  5. Ralf Bruns. Direct chromosome representation and advanced genetic operators for production scheduling. In Stephanie Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 352–359. San Mateo: Morgan Kaufmann, 1993.

    Google Scholar 

  6. D. Corne. Investigating phase transitions in job-shop scheduling. Technical report, University of reading Department of Computer Science, 1996.

    Google Scholar 

  7. D. Corne, P. Ross, and H-L. Fang. Evolving timetables. In L. Chambers, editor, Practical Handbook of Genetic Algorithms: Applications, Volume 1, chapter 8, pages 219–276. CRC Press, 1995.

    Google Scholar 

  8. Yuval Davidor. A naturally occurring niche & species phenomenon: The model and first results. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 257–263. San Mateo: Morgan Kaufmann, 1991.

    Google Scholar 

  9. Yuval Davidor, Takeshi Yamada, and Ryohei Nakano. The ECOlogical framework II: Improving GA performance at virtually zero cost. In Stephanie Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 171–176. San Mateo: Morgan Kaufmann, 1993.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. A. Eiben and Zs. Ruttkay. Self-adaptivity for constraint satisfaction: Learning penalty functions. In ICEC’96: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 258–261. IEEE, 1996.

    Chapter  Google Scholar 

  12. M. Ettl and M. Schwehm. Determining the optimal network partition and kanban allocation in jit production lines. In J. Biethahn and V. Nissen, editors, Evolutionary Algorithms in Management Applications, pages 139–152. SpringerVerlag, Berlin, 1995.

    Chapter  Google Scholar 

  13. E. Falkenauer and S. Bouffouix. A genetic algorithm for job shop. In Proceedings 1991 IEEE International Conference on Robotics and Automation, volume 1, pages 824–829, Sacramento, CA, April, 9–11 1991. IEEE Computer Society Press, Los Alamitos, CA. Cat. No. 91CH2969–4.

    Chapter  Google Scholar 

  14. H-L. Fang, D. Corne, and P. Ross. A genetic algorithm for job-shop problems with various schedule quality criteria. In T. Fogarty, editor, Evolutionary Computing: Proceedings of the 1996 AISB Workshop, volume Lecture Notes in Computer Science. Springer, 1996. to appear.

    Google Scholar 

  15. Hsiao-Lan Fang. Genetic Algorithms in Timetabling and Scheduling. PhD thesis, Department of Artificial Intelligence, University of Edinburgh, 1994.

    Google Scholar 

  16. Hsiao-Lan Fang, Peter Ross, and Dave Corne. A promising Genetic Algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 375–382. San Mateo: Morgan Kaufmann, 1993.

    Google Scholar 

  17. Hsiao-Lan Fang, Peter Ross, and Dave Corne. A promising hybrid GA/heuristic approach for open-shop scheduling problems. In A. Cohn, editor, Proceedings of the 11th European Conference on Artificial Intelligence, pages 590–594. John Wiley & Sons, Ltd., 1994.

    Google Scholar 

  18. B. Filipic. A genetic algorithm applied to resource management in production systems. In J. Biethahn and V. Nissen, editors, Evolutionary Algorithms in Management Applications, pages 10–111. Springer-Verlag, Berlin, 1995.

    Google Scholar 

  19. H. Fisher and G. L. Thompson. Probabilistic learning combinations of local job-shop scheduling rules. In J. F. Muth and G. L. Thompson, editors, Industrial Scheduling, pages 225–251. Prentice Hall, Englewood Cliffs, New Jersey, 1963.

    Google Scholar 

  20. Michael R. Garey and David S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, 1979.

    MATH  Google Scholar 

  21. I. Gerdes. Application of genetic algorithms for solving problems related to free routing for aircraft. In J. Biethahn and V. Nissen, editors, Evolutionary Algorithms in Management Applications, pages 328–340. Springer-Verlag, Berlin, 1995.

    Chapter  Google Scholar 

  22. B. Giffler and G. L. Thompson. Algorithms for solving production scheduling problems. Operations Research, 8(4):487–503, 1960.

    Article  MathSciNet  MATH  Google Scholar 

  23. B. Golden and A. Assad, editors. Vehicle Routing: Methods and Studies, number 16 in Studies in Management Science and Systems. Elsevier, 1991.

    Google Scholar 

  24. Jeffrey Horn and Nicholas Nafpliotis. Multiobjective optimisation using the niched pareto genetic algorithm. Technical Report 93005, Illinois Genetic Algorithms Laboratory (IlliGAL), July 1993.

    Google Scholar 

  25. P. Husbands. Genetic algorithms for scheduling. AISB Quarterly, Autumn (89): 38–45, 1994. ISSN 0268–4179.

    Google Scholar 

  26. P. Husbands and F. Mill. Simulated co-evolution as the mechanism for emergent planning and scheduling. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 264–270. San Mateo: Morgan Kaufmann, 1991.

    Google Scholar 

  27. E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmyos. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. WileyInterscience, 1985.

    Google Scholar 

  28. D. C. Mattfeld, H. Kopfer, and C. Bierwirth. Control of parallel population dynamics by social-like behavior of ga-individuals. In Y. Davidor, H-P. Schwefel, and R. Manner, editors, Parallel Problem-Solving from Nature — PPSN III, number 866 in Lecture Notes in Computer Science, pages 16–25. Springer-Verlag, 1994.

    Chapter  Google Scholar 

  29. T.E. Morton and D.W. Pentico. Heuristic Scheduling Systems. John Wiley, 1993.

    Google Scholar 

  30. R. Nakano, Y. Davidor, and T. Yamada. Optimal population size under constant computation cost. In Y. Davidor, H-P. Schwefel, and B. Manner, editors, Parallel Problem Solving from Nature — PPSN III, number 866 in Lecture Notes in Computer Science, pages 130–148. Springer-Verlag, 1994.

    Chapter  Google Scholar 

  31. Ryohei Nakano. 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.

    Google Scholar 

  32. Ono. A genetic algorithm for job-shop scheduling problems using job-based order crossover. In ICEC’96: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 547–552. IEEE, 1996.

    Chapter  Google Scholar 

  33. S. Rana, A.E. Howe, and D. Whitley. Comparing heuristic, evolutionary and local search approaches to scheduling. In Proceedings of Third International Conference on AI Planning Systems (AIPS-96) (to appear), May 1996.

    Google Scholar 

  34. Alice E. Smith and David M. Tate. Genetic optimisation using a penalty function. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 499–503. San Mateo: Morgan Kaufmann, 1993.

    Google Scholar 

  35. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. A comparison of genetic sequencing operators. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 69–76. San Mateo: Morgan Kaufmann, 1991.

    Google Scholar 

  36. G. Syswerda. Uniform crossover in genetic algorithms. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms and their Applications, pages 2–9. San Mateo: Morgan Kaufmann, 1989.

    Google Scholar 

  37. E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operations Research, 64:278–285, 1993.

    Article  MATH  Google Scholar 

  38. D. Whitley, T. Starkweather, and D. Shaner. Travelling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In L. Davis, editor, Handbook of Genetic Algorithms, pages 350–372. New York: Van Nostrand Reinhold, 1991.

    Google Scholar 

  39. Darrell Whitley, Timothy Starkweather, and D’Ann Fuquay. Scheduling problems and travelling salesmen: The genetic edge recombination operator. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 133–140. San Mateo: Morgan Kaufmann, 1989.

    Google Scholar 

  40. Takeshi Yamada and Ryohei Nakano. A genetic algorithm application to largescale job-shop problems. In R. Manner and B. Manderick, editors, Parallel Problem Solving from Nature II, pages 281–290. Elsevier Science Publisher B.V., 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Reading, UK

    Dave Corne

  2. Department of Artificial Intelligence, University of Edinburgh, UK

    Peter Ross

Authors
  1. Dave Corne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Ross
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Sciences Department, University of Memphis, Memphis, TN, 38152-6429, USA

    Dipankar Dasgupta

  2. Department of Computer Science, University of North Carolina, 9201 University City Boulevard, Charlotte, NC, 28223-0001, USA

    Zbigniew Michalewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Corne, D., Ross, P. (1997). Practical Issues and Recent Advances in Job- and Open-Shop Scheduling. In: Dasgupta, D., Michalewicz, Z. (eds) Evolutionary Algorithms in Engineering Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03423-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-03423-1_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08282-5

  • Online ISBN: 978-3-662-03423-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation