A Multi-Agent Reinforcement Learning Approach to the Dynamic Job Shop Scheduling Problem
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Baykasoglu, Adil & Gocken, Mustafa & Unutmaz, Zeynep D., 2008. "New approaches to due date assignment in job shops," European Journal of Operational Research, Elsevier, vol. 187(1), pages 31-45, May.
- Thierry Moyaux & Yinling Liu & Guillaume Bouleux & Vincent Cheutet, 2023. "An Agent-Based Architecture of the Digital Twin for an Emergency Department," Sustainability, MDPI, vol. 15(4), pages 1-13, February.
- Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
- 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.
- Adil Baykasoğlu & Fatma S. Karaslan, 2017. "Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3308-3325, June.
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.- Yu Pu & Fang Li & Shahin Rahimifard, 2024. "Multi-Agent Reinforcement Learning for Job Shop Scheduling in Dynamic Environments," Sustainability, MDPI, vol. 16(8), pages 1-26, April.
- Thiesse, Frédéric & Fleisch, Elgar, 2008. "On the value of location information to lot scheduling in complex manufacturing processes," International Journal of Production Economics, Elsevier, vol. 112(2), pages 532-547, April.
- Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
- Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011.
"A hybrid single and dual population search procedure for the job shop scheduling problem,"
European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
- V. Sels & K. Craeymeersch & M. Vanhoucke, 2010. "A hybrid single and dual population search procedure for the job shop scheduling problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 10/679, Ghent University, Faculty of Economics and Business Administration.
- Jacomine Grobler & Andries Engelbrecht & Schalk Kok & Sarma Yadavalli, 2010. "Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time," Annals of Operations Research, Springer, vol. 180(1), pages 165-196, November.
- Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
- Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
- Tanja Mlinar & Philippe Chevalier, 2016.
"Pooling heterogeneous products for manufacturing environments,"
4OR, Springer, vol. 14(2), pages 173-200, June.
- MLINAR, Tanja & CHEVALIER, Philippe, 2016. "Pooling Heterogeneous Products for Manufacturing Environments," LIDAM Reprints CORE 2744, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- Zhang, Rui & Song, Shiji & Wu, Cheng, 2013. "A hybrid artificial bee colony algorithm for the job shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 167-178.
- Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
- 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.
- 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.
- Vinod, V. & Sridharan, R., 2011. "Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 127-146, January.
- Varela, Ramiro & Vela, Camino R. & Puente, Jorge & Gomez, Alberto, 2003. "A knowledge-based evolutionary strategy for scheduling problems with bottlenecks," European Journal of Operational Research, Elsevier, vol. 145(1), pages 57-71, February.
- Pham, Dinh-Nguyen & Klinkert, Andreas, 2008. "Surgical case scheduling as a generalized job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1011-1025, March.
- El-Bouri, A. & Azizi, N. & Zolfaghari, S., 2007. "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1894-1910, March.
- Christophe Sauvey & Wajdi Trabelsi & Nathalie Sauer, 2020. "Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems," Mathematics, MDPI, vol. 8(1), pages 1-17, January.
- Dušan Hvalica, 2013. "Solving job shop problems in the context of hypergraphs," 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. 21(1), pages 27-40, June.
- Pisut Pongchairerks, 2019. "A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem," Complexity, Hindawi, vol. 2019, pages 1-11, March.
More about this item
Keywords
dynamic job shop scheduling problem; multi-agent system; reinforcement learning; Industry 4.0; dispatching rules;All these keywords.
Statistics
Access and download statisticsCorrections
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:gam:jsusta:v:15:y:2023:i:10:p:8262-:d:1150542. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.