Skip to main content
SpringerLink
Log in

Recent Advances in Evolutionary Algorithms for Job Shop Scheduling

  • Chapter
Automated Scheduling and Planning

Part of the book series: Studies in Computational Intelligence ((SCI,volume 505))

Abstract

Scheduling decides the order of tasks to efficiently use resources considering criteria such as minimization of the number of late tasks, minimization of the completion time, minimization of the idle times of the machines, etc. Approaches for solving scheduling problems can be divided into three broad groups: (a) exact methods that produce exact optimal solutions, (b) approximation methods that find high quality near optimal, and (c) hybrid methods based on the first two. Approximate methods can be easily combined with other types of heuristics and can be applied to a wide range of problems.

In the category of approximation algorithms, evolutionary algorithms (EAs) are very promising tools for the problems with dynamic characteristics, contradicting multi-objectives and highly nonlinear constraints. For EAs to be effective and efficient for a combinatorial optimisation problem like scheduling, the structure of an EA needs to be designed carefully to exploit the problem structures. An appropriate representation for the problem and the type of search operators suitable for the representation should be studied because they directly affect the search efficiency of the EA.

In this chapter, our focus will be on EAs for job shop scheduling problems (JSP). First, JSP will be formulated as an optimization problem and approaches for JSP will be given briefly. Second, EAs will be introduced and the key issues in the application of EAs for JSP will be emphasized. Third, various representations used in EAs for handling JSP will be described and advantages and drawbacks of different representations will be described based on the results from the literature. Forth, crossover and mutation operators designed for particular representations will be illustrated and their strength and limitations will be discussed. Almost all successful applications of evolutionary combinatorial optimisation include some kind of hybrid algorithms, where both EAs and local search were used. The seventh topic of this chapter is devoted to local search strategies which are frequently integrated into EAs.

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 109.99
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

  • Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34(3), 391–401 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  • Bean, J.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal of Computing 6(2), 154–160 (1994)

    Article  MATH  Google Scholar 

  • Bean, J., Norman, B.: Random keys for jos shop scheduling, technical report 93-7. Technical report, Dept. of Industrial and Operations Engineering, University of Michigan (1993)

    Google Scholar 

  • Bierwirth, C.: A generalized permutation approach to job-shop scheduling with genetic algorithms. OR Spektrum 17(2-3), 87–92 (1995)

    Article  MATH  Google Scholar 

  • Bierwirth, C., Mattfeld, D., Kopfer, H.: On permutation representations for scheduling problems. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, Springer, Heidelberg (1996)

    Google Scholar 

  • Chen, H., Ihlow, J., Lehmann, C.: A genetic algorithm for flexible job-shop scheduling. In: Proceedings. 1999 IEEE International Conference on Robotics and Automation, vol. 2, pp. 1120–1125 (1999)

    Google Scholar 

  • Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms: part ii. hybrid genetic search strategies. Comput. Ind. Eng. 37, 51–55 (1999)

    Article  Google Scholar 

  • Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol. 1, pp. 162–164. Morgan Kaufmann Publishers Inc., San Francisco (1985)

    Google Scholar 

  • Dorndorf, U., Pesch, E.: Evolution based learning in a job shop scheduling environment. Computers & OR 22(1), 25–40 (1995)

    Article  MATH  Google Scholar 

  • Falkenauer, E., Bouffouix, S.: A genetic algorithm for job shop. In: Proceedings of the 1991 IEEE International Conference on Robotics and Automation, pp. 824–829 (1991)

    Google Scholar 

  • Gantt, H.L.: Work, Wages and Profits. The Engineering Magazine (1910)

    Google Scholar 

  • Gen, M., Cheng, R., Lin, L.: Network Models and Optimization: Multiobjective Genetic Algorithm Approach (Decision Engineering). Springer (2008)

    Google Scholar 

  • Gen, M., Tsujimura, Y., Kubota, E.: Solving job-shop scheduling problem using genetic algorithms. In: Proceedings of the 16th International Conference on Computer and Industrial Engineering, Ashikaga, Japan, pp. 576–579 (1994)

    Google Scholar 

  • Giffler, J., Thompson, G.: Algorithms for solving production scheduling problems. Operations Research 8, 487–503 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  • Glover, F.: Tabu search - part 1. ORSA Journal on Computing 1(2), 190–206 (1989)

    Article  MATH  Google Scholar 

  • Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)

    MATH  Google Scholar 

  • Goldberg, D.E., Lingle, J.: Alleles, Loci and the Travelling Salesman Problem. In: Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum Associates, New Jersey (1985)

    Google Scholar 

  • Gu, J., Gu, M., Cao, C., Gu, X.: A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem. Comput. Oper. Res. 37, 927–937 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  • Gu, J., Gu, X., Gu, M.: A novel parallel quantum genetic algorithm for stochastic job shop scheduling. Journal of Mathematical Analysis and Applications 355(1), 63–81 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operations Research 130, 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Hasan, S., Sarker, R., Essam, D., Cornforth, D.: A Genetic Algorithm with Priority Rules for Solving Job-Shop Scheduling Problems. In: Chiong, R., Dhakal, S. (eds.) Natural Intelligence for Scheduling, Planning and Packing Problems. SCI, vol. 250, pp. 55–88. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  • Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 32(1), 1–13 (2002)

    Article  Google Scholar 

  • Kleeman, M.P., Lamont, G.B.: Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes. In: Dahal, K.P., Tan, K.C., Cowling, P.I. (eds.) Evolutionary Scheduling. SCI, vol. 49, pp. 49–99. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  • Kobayashi, S., Ono, I., Yamamura, M.: An efficient genetic algorithm for job shop scheduling problems. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 506–511. Morgan Kaufmann Publishers Inc., San Francisco (1995)

    Google Scholar 

  • Mattfeld, D.C., Bierwirth, C.: An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research 155, 616–630 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  • Mesghouni, K., Hammadi, S., Borne, P.: Evolution programs for job-shop scheduling. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, vol. 1, pp. 720–725 (1997)

    Google Scholar 

  • Mesghouni, K., Pesin, P., Trentesaux, D., Hammadi, S., Tahon, C., Borne, P.: Hybrid approach to decision making for job-shop scheduling. Prod. Plann. Contr. J. 10(7), 690–706 (1999)

    Article  Google Scholar 

  • Nakano, R., Yamada, T.: Conventional genetic algorithm for job shop problems. In: International Conference on Genetic Algorithms, ICGA 1991, pp. 474–479 (1991)

    Google Scholar 

  • Norman, B., Bean, J.: Random keys genetic algorithm for scheduling:unabridged version, technical report 95-10. Technical report, Dept. of Industrial and Operations Engineering, University of Michigan (1995)

    Google Scholar 

  • Phan, H.T.: Constraint Propagation in Flexible Manufacturing. Springer-Verlag New York, Inc. (2000)

    Google Scholar 

  • Ponnambalam, S.G., Aravindan, P., Rao, P.S.: Comparative evaluation of genetic algorithms for job-shop scheduling. Production Planning and Control 12(6), 560–574 (2001)

    Article  Google Scholar 

  • Rothlauf, F.: Representations for evolutionary algorithms. In: Proceedings of the 2008 GECCO Conference Companion on Genetic and Evolutionary Computation, GECCO 2008, pp. 2613–2638 (2008)

    Google Scholar 

  • Roy, B., Sussmann, B.: Note ds no 9 bis: Les probl’emes d’ordonnancement avec contraintes disjonctives. Technical report, SEMA, Paris (1964)

    Google Scholar 

  • Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 2–9. Morgan Kaufmann Publishers Inc., San Francisco (1989)

    Google Scholar 

  • Syswerda, G.: Schedule Optimization Using Genetic Algorithms. In: Handbook of Genetic Algorithms, pp. 332–349. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  • Wang, Y., Yin, H., Wang, J.: Genetic algorithm with new encoding scheme for job shop scheduling. The International Journal of Advanced Manufacturing Technology 44, 977–984 (2009)

    Article  Google Scholar 

  • Widmer, M., Hertz, A., Costa, D.: Metaheuristics and Scheduling. In: Production Scheduling, pp. 33–68. Wiley (2008)

    Google Scholar 

  • Wu, Y., Li, B.: Job-shop scheduling using genetic algorithms. In: Proc. IEEE Int’l Conf. on System, Man and Cybernetics. IEEE SMC 1996, vol. 3, pp. 1994–1999 (1996)

    Google Scholar 

  • Xhafa, F.: A hybrid evolutionary heuristic for job scheduling on computational grids. In: Abraham, A., Grosan, C., Ishibuchi, H. (eds.) Hybrid Evolutionary Algorithms. SCI, vol. 75, pp. 269–311. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  • Yamada, T.: Studies on Metaheuristics for Jobshop and Flowshop Scheduling Problems. PhD thesis, Kyoto University (2003)

    Google Scholar 

  • Yamada, T., Nakano, R.: A genetic algorithm applicable to large-scale job-shop problems. In: Parallel Problem Solving from Nature: PPSN II, pp. 281–290. North-Holland, Elsevier Science Publishers (1992)

    Google Scholar 

  • Yan, Z., Hongze, Q.: A symbiotic evolutionary algorithm for flexible job scheduling problem. In: Second International Workshop on Computer Science and Engineering, WCSE 2009, vol. 1, pp. 79–83 (2009)

    Google Scholar 

  • Zhang, C.-Y., Li, P., Rao, Y., Li, S.: A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 246–259. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering, Erciyes University, 38039, Melikgazi, Kayseri, Turkey

    Bahriye Akay

  2. Center of Excellence for Research in Computational Intelligence and Applications, School of Computer Science, University of Birmingham, Birmingham, B15 2TT, U.K

    Xin Yao

Authors
  1. Bahriye Akay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bahriye Akay .

Editor information

Editors and Affiliations

  1. , Elektrik-Elektronik Fakultesi, Istanbul Teknik Universitesi, Istanbul, 34469, Turkey

    A. Sima Uyar

  2. , School of Computer Science, University of Nottingham, Wollaton Road, Nottingham, NG8 1BB, United Kingdom

    Ender Ozcan

  3. , Centre for Emergent Computing, Edinburgh Napier University, 10 Colinton Road, Edinburgh, EH10 5DT, United Kingdom

    Neil Urquhart

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Akay, B., Yao, X. (2013). Recent Advances in Evolutionary Algorithms for Job Shop Scheduling. In: Uyar, A., Ozcan, E., Urquhart, N. (eds) Automated Scheduling and Planning. Studies in Computational Intelligence, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39304-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39304-4_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39303-7

  • Online ISBN: 978-3-642-39304-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation