Genetic Algorithms for Creating Large Job Shop Dispatching Rules

  • Erich C. TeppanEmail author
  • Giacomo Da Col
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 170)


Generating optimized large-scale production plans is an important open problem where even small improvements result in significant savings. Application scenarios in the semiconductor industry comprise thousands of machines and hundred thousands of job operations and are therefore among the most challenging scheduling problems regarding their size. In this paper, we present a novel approach for automatically creating composite dispatching rules, i.e. heuristics for job sequencing, for makespan optimization in such large-scale job shops. The approach builds on the combination of event-based simulation and genetic algorithms. We test our approach on a set of benchmark instances with proven optima that comprise up to 100000 operations to be scheduled on up to 1000 machines. With respect to this large-scale benchmark, we present the results of an experiment comparing well-known dispatching rules with automatically created composite dispatching rules produced by our system. Furthermore, we also compare our proposed system with two foregoing approaches building on composite dispatching rules. It is shown that our proposed system is able to come up with highly effective dispatching rules such that makespan reductions of up to 38% can be achieved compared to single dispatching rules. In fact, it often produces near optimal or even optimal schedules and outperforms the competitor systems in a majority of cases.



Work has partially been conducted in the scope of the research project Productive4.0 (H2020-ECSEL-GANo.: 737459).


  1. 1.
    Barták, R., Salido, M., Rossi, F.: New trends in constraint satisfaction, planning, and scheduling: a survey. Knowl. Eng. Rev. 25(3), 249–279 (2010). Scholar
  2. 2.
    Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling: Models and Methods for Advanced Planning (International Handbooks on Information Systems). Springer, New York Inc., Secaucus, NJ (2007)Google Scholar
  3. 3.
    Bożejko, W., Gnatowski, A., Pempera, J., Wodecki, M.: Parallel tabu search for the cyclic job shop scheduling problem. Comput. Ind. Eng. 113, 512–524 (2017)CrossRefGoogle Scholar
  4. 4.
    Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl. Math. 49(1), 107–127 (1994)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695–1724 (2013)CrossRefGoogle Scholar
  6. 6.
    Conway, R.W.: An experimental investigation of priority assignment in a job shop. RM-3789-PR (1964)Google Scholar
  7. 7.
    Conway, R.W.: Priority dispatching and work-in-process inventory in a job shop. J. Ind. Eng. 16, 228–237 (1965)Google Scholar
  8. 8.
    Da Col, G., Teppan, E.C.: Declarative decomposition and dispatching for large-scale job-shop scheduling. Joint German/Austrian Conference on Artificial Intelligence (Künstliche Intelligenz), pp. 134–140. Springer, Cham (2016)Google Scholar
  9. 9.
    Da Col, G., Teppan, E.C.: Learning constraint satisfaction heuristics for configuration problems. In: 19th International Configuration Workshop, pp. 8–11 (2017)Google Scholar
  10. 10.
    Da Col, G., Teppan, E.C.: Google versus IBM: A constraint solving challenge on the job-shop scheduling problem. In: 35th International Conference on Logic Programming (ICLP’19) (2019)Google Scholar
  11. 11.
    Da Col, G., Teppan, E.C.: Industrial size job shop scheduling tackled by present day cp solvers. In: 25th International Conference on Principles and Practice of Constraint Programming (CP’19) (2019)Google Scholar
  12. 12.
    Danna, E., Perron, L.: Structured versus unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. In: Rossi, F. (ed.) Principles and Practice of Constraint Programming - CP 2003, pp. 817–821. Springer, Berlin, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Demirkol, E., Mehta, S., Uzsoy, R.: Benchmarks for shop scheduling problems. Euro. J. Oper. Res. 109(1), 137–141 (1998)CrossRefGoogle Scholar
  14. 14.
    Falkner, A., Friedrich, G., Schekotihin, K., Taupe, R., Teppan, E.C.: Industrial applications of answer set programming. KI-Künstliche Intelligenz pp. 1–12 (2018)Google Scholar
  15. 15.
    Friedrich, G., Frühstück, M., Mersheeva, V., Ryabokon, A., Sander, M., Starzacher, A., Teppan, E.: Representing production scheduling with constraint answer set programming. In: Operations Research Proceedings 2014, pp. 159–165. Springer, Cham (2016)Google Scholar
  16. 16.
    Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY (1990)Google Scholar
  17. 17.
    Hildebrandt, T., Goswami, D., Freitag, M.: Large-scale simulation-based optimization of semiconductor dispatching rules. In: Proceedings of the 2014 Winter Simulation Conference, IEEE Press, Piscataway, NJ, USA, WSC ’14, pp. 2580–2590 (2014)Google Scholar
  18. 18.
    Kaban, K.A., Othman, Z., Rohmah, D.: Comparison of dispatching rules in job-shop scheduling problems using simulation: a case study. Int. J. Simul. Modell. 11, 129–140 (2012)CrossRefGoogle Scholar
  19. 19.
    Kaban, A.K., Othman, Z., Rohmah, D.S.: Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study. Int. J. Simul. Modell. 11(3), 129–140 (2012)CrossRefGoogle Scholar
  20. 20.
    Ku, W.Y., Beck, J.C.: Mixed integer programming models for job shop scheduling: a computational analysis. Comput. Oper. Res. 73, 165–173 (2016)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Panwalkar, S.S., Iskander, W.: A survey of scheduling rules. Oper. Res. 25(1), 45–61 (1977)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202–3212 (2008)CrossRefGoogle Scholar
  23. 23.
    Sadegheih, A.: Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance. Appl. Math. Modell. 30(2), 147–154 (2006)CrossRefGoogle Scholar
  24. 24.
    Sadeh, N.M., Fox, M.S.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artif. Intell. 86, 1–41 (1996)CrossRefGoogle Scholar
  25. 25.
    Stecco, G., Cordeau, J.F., Moretti, E.: A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times. Comput. Oper. Res. 35(8), 2635–2655 (2008)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Taillard, E.: Benchmarks for basic scheduling problems. Euro. J. Oper. Res. 64(2), 278–285 (1993) (project Management ANF Scheduling)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Teppan, E.C.: Solving the partner units configuration problem with heuristic constraint answer set programming. In: Configuration Workshop, pp. 61–68 (2016)Google Scholar
  28. 28.
    Teppan, E.C.: Light weight generation of dispatching rules for large-scale job shop scheduling. In: International Conference on Artificial Intelligence (ICAI’19), pp. 330–333 (2019)Google Scholar
  29. 29.
    Teppan, E.C., Da Col, G.: Automatic generation of dispatching rules for large job shops by means of genetic algorithms. In: 8th International Workshop on Combinations of Intelligent Methods and Applications (CIMA’18), pp. 1–15 (2018)Google Scholar
  30. 30.
    Teppan, E.C., Da Col, G.: Dispatching rules revisited-a large scale job shop scheduling experiment. In: IEEE Symposium Series on Computational Intelligence, SSCI 2018, Bangalore, India, November 18–21, 2018, pp. 561–568 (2018)Google Scholar
  31. 31.
    Teppan, E.C., Friedrich, G.: Heuristic constraint answer set programming. In: ECAI, pp. 1692–1693 (2016)Google Scholar
  32. 32.
    Teppan, E.C., Friedrich, G.: Heuristic constraint answer set programming for manufacturing problems. In: Advances in Hybridization of Intelligent Methods. Springer, Berlin, pp. 119–147 (2018)Google Scholar
  33. 33.
    Watson, J.P., Beck, J.C., Howe, A.E., Whitley, L.D.: Problem difficulty for tabu search in job-shop scheduling. Artif. Intell. 143(2), 189–217 (2003)MathSciNetCrossRefGoogle Scholar
  34. 34.
    Zhang, R., Wu, C.: A hybrid approach to large-scale job shop scheduling. Appl. Intell. 32(1), 47–59 (2010)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Alpen-Adria Universität KlagenfurtKlagenfurtAustria

Personalised recommendations