Skip to main content

Optimizing Dispatching Rules for Stochastic Job Shop Scheduling

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 923))

Abstract

Manufacturing environments commonly present uncertainties and unexpected schedule disruptions. The literature has shown that in these environments simple and fast dynamic dispatching rules are efficient sequencing methods. However, most of the works in the automated designing of these rules have considered deterministic processing times. This work aims to design dispatching rules for problem settings similar to the ones found in real environments such as uncertain processing times and sequence-dependent setup times. We use Genetic Programming to generate efficient rules for stochastic job shops with setup times. We show that the generated rules outperform benchmark dispatching rules, specially in settings with high setup time levels.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

References

  1. Blackstone, J.H., Phillips, D.T., Hogg, G.L.: A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Prod. Res. 20(1), 27–45 (1982)

    Article  Google Scholar 

  2. Dominic, P.D.D., Kaliyamoorthy, S., Kumar, M.S.: Efficient dispatching rules for dynamic job shop scheduling. Int. J. Adv. Manuf. Technol. 24(1), 70–75 (2004)

    Google Scholar 

  3. Gonçalves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487–525 (2011)

    Article  Google Scholar 

  4. Haupt, R.: A survey of priority rule-based scheduling. Oper.-Res.-Spektrum 11(1), 3–16 (1989)

    Google Scholar 

  5. Hildebrandt, T., Heger, J., Scholz-Reiter, B.: Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO 2010, pp. 257–264. ACM, New York (2010)

    Google Scholar 

  6. Holthaus, O., Rajendran, C.: Efficient dispatching rules for scheduling in a job shop. Int. J. Prod. Econ. 48(1), 87–105 (1997)

    Article  Google Scholar 

  7. Karunakaran, D., Mei, Y., Chen, G., Zhang, M.: Evolving dispatching rules for dynamic job shop scheduling with uncertain processing times. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 364–371 (2017)

    Google Scholar 

  8. Koza, J.R.: Genetic programming as a means for programming computers by natural selection. Stat. Comput. 4(2), 87–112 (1994)

    Article  Google Scholar 

  9. Kronberger, G.K.: Symbolic regression for knowledge discovery - bloat, overfitting, and variable interaction networks. Ph.D. thesis, Johannes Kepler University, Linz, Austria (2010)

    Google Scholar 

  10. Lawrence, S.R., Sewell, E.C.: Heuristic, optimal, static, and dynamic schedules when processing times are uncertain. J. Oper. Manag. 15(1), 71–82 (1997)

    Article  Google Scholar 

  11. Luke, S.: ECJ then and now. In: GECCO (2017)

    Google Scholar 

  12. Nguyen, S., Mei, Y., Xue, B., Zhang, M.: A hybrid genetic programming algorithm for automated design of dispatching rules. Evol. Comput. 1–31 (2018, preprint). https://doi.org/10.1162/evco_a_00230

  13. Nguyen, S., Mei, Y., Zhang, M.: Genetic programming for production scheduling: a survey with a unified framework. Complex Intell. Syst. 3(1), 41–66 (2017)

    Article  Google Scholar 

  14. Pinedo, M.L.: Scheduling - Theory, Algorithms and Systems, 3rd edn. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  15. Shahzad, A., Mebarki, N.: Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem. Eng. Appl. Artif. Intell. 25(6), 1173–1181 (2012)

    Article  Google Scholar 

Download references

Acknowledgments

This work is financed by the ERDF - European Regional Development Fund through the Operational Programme for Competitiveness and Internationalisation - COMPETE 2020 Programme, and by National Funds through the Portuguese funding agency, FCT - Fundação para a Ciência e a Tecnologia, within project SAICTPAC/0034/2015- POCI-01-0145-FEDER-016418.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cristiane Ferreira .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ferreira, C., Figueira, G., Amorim, P. (2020). Optimizing Dispatching Rules for Stochastic Job Shop Scheduling. In: Madureira, A., Abraham, A., Gandhi, N., Varela, M. (eds) Hybrid Intelligent Systems. HIS 2018. Advances in Intelligent Systems and Computing, vol 923. Springer, Cham. https://doi.org/10.1007/978-3-030-14347-3_31

Download citation

Publish with us

Policies and ethics