IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v23y2015i1p235-249.html
   My bibliography  Save this article

Dispatching rule selection with Gaussian processes

Author

Listed:
  • Jens Heger
  • Torsten Hildebrandt
  • Bernd Scholz-Reiter

Abstract

Decentralized scheduling with dispatching rules is applied in many fields of logistics and production, especially in highly complex and dynamic scenarios, such as semiconductor manufacturing. Many dispatching rules are proposed in the literature, which perform well on specific scenarios. No rule is known, however, consistently outperforming all other rules. One approach to meet this challenge and improve scheduling performance is to select and switch dispatching rules depending on current system conditions. For this task machine learning techniques (e.g., Artificial Neural Networks) are frequently used. In this paper we investigate the use of a machine learning technique not applied to this task before: Gaussian process regression. Our analysis shows that Gaussian processes predict dispatching rule performance better than Neural Networks in most settings. Additionally, already a single Gaussian Process model can easily provide a measure of prediction quality. This is in contrast to many other machine learning techniques. We show how to use this measure to dynamically add additional training data and incrementally improve the model where necessary. Results therefore suggest, Gaussian processes are a very promising technique, which can lead to better scheduling performance (e.g., reduced mean tardiness) compared to other techniques. Copyright Springer-Verlag Berlin Heidelberg 2015

Suggested Citation

  • Jens Heger & Torsten Hildebrandt & Bernd Scholz-Reiter, 2015. "Dispatching rule selection with Gaussian processes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(1), pages 235-249, March.
  • Handle: RePEc:spr:cejnor:v:23:y:2015:i:1:p:235-249
    DOI: 10.1007/s10100-013-0322-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-013-0322-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10100-013-0322-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jon K. Wilbrecht & William B. Prescott, 1969. "The Influence of Setup Time on Job Shop Performance," Management Science, INFORMS, vol. 16(4), pages 274-280, December.
    2. Brian J. Huffman, 2001. "An Object-Oriented Version of SIMLIB (A Simple Simulation Package)," INFORMS Transactions on Education, INFORMS, vol. 2(1), pages 1-15, September.
    3. Karsten Hentsch & Peter Köchel, 2011. "Job scheduling with forbidden setups and two objectives using genetic algorithms and penalties," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(3), pages 285-298, September.
    4. Sergey Dashkovskiy & Hamid Karimi & Michael Kosmykov, 2012. "A Lyapunov–Razumikhin approach for stability analysis of logistics networks with time-delays," International Journal of Systems Science, Taylor & Francis Journals, vol. 43(5), pages 845-853.
    5. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    6. Holthaus, Oliver & Rajendran, Chandrasekharan, 1997. "Efficient dispatching rules for scheduling in a job shop," International Journal of Production Economics, Elsevier, vol. 48(1), pages 87-105, January.
    7. Rajendran, Chandrasekharan & Holthaus, Oliver, 1999. "A comparative study of dispatching rules in dynamic flowshops and jobshops," European Journal of Operational Research, Elsevier, vol. 116(1), pages 156-170, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Heng Zhang & Utpal Roy, 2019. "A semantics-based dispatching rule selection approach for job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2759-2779, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Branke, Juergen & Pickardt, Christoph W., 2011. "Evolutionary search for difficult problem instances to support the design of job shop dispatching rules," European Journal of Operational Research, Elsevier, vol. 212(1), pages 22-32, July.
    2. Pickardt, Christoph W. & Hildebrandt, Torsten & Branke, Jürgen & Heger, Jens & Scholz-Reiter, Bernd, 2013. "Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems," International Journal of Production Economics, Elsevier, vol. 145(1), pages 67-77.
    3. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    4. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Longest path analysis in networks of queues: Dynamic scheduling problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 132-149, October.
    5. Petroni, Alberto & Rizzi, Antonio, 2002. "A fuzzy logic based methodology to rank shop floor dispatching rules," International Journal of Production Economics, Elsevier, vol. 76(1), pages 99-108, March.
    6. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2022. "Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning," Omega, Elsevier, vol. 111(C).
    7. Alvarez-Valdes, R. & Fuertes, A. & Tamarit, J. M. & Gimenez, G. & Ramos, R., 2005. "A heuristic to schedule flexible job-shop in a glass factory," European Journal of Operational Research, Elsevier, vol. 165(2), pages 525-534, September.
    8. Yannik Zeiträg & José Rui Figueira, 2023. "Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling," Journal of Scheduling, Springer, vol. 26(3), pages 289-314, June.
    9. Jianjun Liu & Martin J. Land & Jos A. C. Bokhorst & Qingxin Chen, 2023. "Improving coordination in assembly job shops: redesigning order release and dispatching," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 669-697, September.
    10. Lodree, Emmett & Jang, Wooseung & Klein, Cerry M., 2004. "A new rule for minimizing the number of tardy jobs in dynamic flow shops," European Journal of Operational Research, Elsevier, vol. 159(1), pages 258-263, November.
    11. Heng Zhang & Utpal Roy, 2019. "A semantics-based dispatching rule selection approach for job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2759-2779, October.
    12. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    13. Sweeney, Kevin D. & Sweeney, Donald C. & Campbell, James F., 2019. "The performance of priority dispatching rules in a complex job shop: A study on the Upper Mississippi River," International Journal of Production Economics, Elsevier, vol. 216(C), pages 154-172.
    14. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2008. "Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop," International Journal of Production Economics, Elsevier, vol. 113(2), pages 819-833, June.
    15. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    16. Xiong, Hegen & Fan, Huali & Jiang, Guozhang & Li, Gongfa, 2017. "A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints," European Journal of Operational Research, Elsevier, vol. 257(1), pages 13-24.
    17. Jayamohan, M. S. & Rajendran, Chandrasekharan, 2004. "Development and analysis of cost-based dispatching rules for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 157(2), pages 307-321, September.
    18. Drexl, Andreas & Kolisch, Rainer, 1991. "Produktionsplanung und -steuerung bei Einzel- und Kleinserienfertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 281, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Binzi Xu & Kai Xu & Baolin Fei & Dengchao Huang & Liang Tao & Yan Wang, 2024. "Automatic Design of Energy-Efficient Dispatching Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling Based on Dual Feature Weight Sets," Mathematics, MDPI, vol. 12(10), pages 1-24, May.
    20. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:23:y:2015:i:1:p:235-249. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.