The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning
Abstract
In modern manufacturing industry, dynamic scheduling methods are urgently needed with the sharp increase of uncertainty and complexity in production process. To this end, this paper addresses the dynamic flexible job shop scheduling problem (DFJSP) under new job insertions aiming at minimizing the total tardiness. Without lose of generality, the DFJSP can be modeled as a Markov decision process (MDP) where an intelligent agent should successively determine which operation to process next and which machine to assign it on according to the production status of current decision point, making it particularly feasible to be solved by reinforcement learning (RL) methods. In order to cope with continuous production states and learn the most suitable action (i.e. dispatching rule) at each rescheduling point, a deep Q-network (DQN) is developed to address this problem. Six composite dispatching rules are proposed to simultaneously select an operation and assign it on a feasible machine every time an operation is completed or a new job arrives. Seven generic state features are extracted to represent the production status at a rescheduling point. By taking the continuous state features as input to the DQN, the state–action value (Q-value) of each dispatching rule can be obtained. The proposed DQN is trained using deep Q-learning (DQL) enhanced by two improvements namely double DQN and soft target weight update. Moreover, a “softmax” action selection policy is utilized in real implementation of the trained DQN so as to promote the rules with higher Q-values while maintaining the policy entropy. Numerical experiments are conducted on a large number of instances with different production configurations. The results have confirmed both the superiority and generality of DQN compared to each composite rule, other well-known dispatching rules as well as the stand Q-learning-based agent.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Advances in Neural Information Processing Systems 29
Teymur, O., Zygalakis, K., & Calderhead, B. (2016) · Cited by 13,887
Continuous control with deep reinforcement learning
Lillicrap, T. P., Hunt, J. J., Pritzel, A., Heess, N., Erez, T., Tassa, Y., Silver, D., & Wierstra, D. (2015) · arXiv · doi:10.48550/arxiv.1509.02971 · Cited by 10,782
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
Reinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,414
Dynamic Programming and Markov Processes.
Freimer, M., & Howard, R. A. (1961) · Journal of the American Statistical Association · doi:10.2307/2282268 · Cited by 3,378
Deep Reinforcement Learning with Double Q-Learning
Van Hasselt, H., Guez, A., & Silver, D. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10295 · Cited by 3,318
Bellman, R. (1957) · Indiana University Mathematics Journal · doi:10.1512/iumj.1957.6.56038 · Cited by 2,408
Advances in Neural Information Processing Systems 21
Griffiths, T. L., Lucas, C. G., Williams, J. J., & Kalish, M. L. (2009) · neural information processing systems · Cited by 1,854
A survey of dynamic scheduling in manufacturing systems
Ouelhadj, D., & Petrović, S. (2008) · Journal of Scheduling · doi:10.1007/s10951-008-0090-8 · Cited by 1,031
Learning Combinatorial Optimization Algorithms over Graphs
Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., & Song, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01665 · Cited by 1,007
Deep Reinforcement Learning: An Overview
Li, Y. (2017) · arXiv · doi:10.48550/arxiv.1701.07274 · Cited by 762
Dynamic Programming and Markov Processes.
Kaufman, H., & Howard, R. A. (1961) · The American Mathematical Monthly · doi:10.2307/2312519 · Cited by 638
Optimization of global production scheduling with deep reinforcement learning
Waschneck, B., Reichstaller, A., Belzner, L., Altenmüller, T., Bauernhansl, T., Knapp, A., & Kyek, A. (2018) · Procedia CIRP · doi:10.1016/j.procir.2018.03.212 · Cited by 366
A reinforcement learning approach to parameter estimation in dynamic job shop scheduling
Shahrabi, J., Adibi, M. A., & Mahootchi, M. (2017) · Computers & Industrial Engineering · doi:10.1016/j.cie.2017.05.026 · Cited by 313
Device Placement Optimization with Reinforcement Learning
Mirhoseini, A., Pham, H., Le, Q. V., Steiner, B., Larsen, R., Zhou, Y., Kumar, N., Norouzi, M., Bengio, S., & Dean, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.04972 · Cited by 299
A comparative study of dispatching rules in dynamic flowshops and jobshops
Rajendran, C., & Holthaus, O. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00023-x · Cited by 294
Dynamic job-shop scheduling using reinforcement learning agents
Aydin, M. E., & Öztemel, E. (2000) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(00)00087-7 · Cited by 274
Gao, K., Suganthan, P. N., Chua, T. J., Chong, C. S., Cai, T. X., & Pan, Q.-K. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.06.004 · Cited by 228
Shen, X.-N., & Yao, X. (2015) · Information Sciences · doi:10.1016/j.ins.2014.11.036 · Cited by 228
Real-time scheduling for a smart factory using a reinforcement learning approach
Shiue, Y.-R., Lee, K.-C., & Su, C.-T. (2018) · Computers & Industrial Engineering · doi:10.1016/j.cie.2018.03.039 · Cited by 225
Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem
Kundakcı, N., & Kulak, O. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2016.03.011 · Cited by 219
Distributed policy search reinforcement learning for job-shop scheduling tasks
Gabel, T., & Riedmiller, M. (2011) · International Journal of Production Research · doi:10.1080/00207543.2011.571443 · Cited by 94
Xiong, H., Fan, H., Jiang, G., & Li, G. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.07.030 · Cited by 92
ADAPTIVE REACTIVE JOB-SHOP SCHEDULING WITH REINFORCEMENT LEARNING AGENTS
Gabel, T., & Riedmiller, M. (2008) · Cited by 81
Learning policies for single machine job dispatching
Wang, Y.-C., & Usher, J. M. (2004) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2004.07.003 · Cited by 44
Chen, X., Hao, X., Lin, H. W., & Murata, T. (2010) · IEEE International Conference on Automation and Logistics (ICAL) · doi:10.1109/ical.2010.5585316 · Cited by 39
Deep reinforcement learning: Algorithm, applications, and ultra-low-power implementation
Li, H., Cai, R., Liu, N., Lin, X., & Wang, Y. (2018) · Nano Communication Networks · doi:10.1016/j.nancom.2018.02.003 · Cited by 39
A Deep Reinforcement Learning Approach to Multi-Component Job Scheduling in Edge Computing
Cao, Z. G., Zhang, H., Cao, Y., & Liu, B. (2019) · International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) · doi:10.1109/msn48538.2019.00018 · Cited by 14
A Deep Reinforcement Learning Approach to Multi-component Job Scheduling in Edge ComputingPreprint
Cao, Z. G., Zhang, H., Cao, Y., & Liu, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.10290 · Cited by 1
Cited by
Deep reinforcement learning in smart manufacturing: A review and prospects
Li, C., Zheng, P., Yin, Y., Wang, B., & Wang, L. (2023) · CIRP Journal of Manufacturing Science and Technology · doi:10.1016/j.cirpj.2022.11.003 · Cited by 327
Deep reinforcement learning for dynamic scheduling of a flexible job shop
Liu, R., Piplani, R., & Toro, C. (2022) · International Journal of Production Research · doi:10.1080/00207543.2022.2058432 · Cited by 310
Deep reinforcement learning in production systems: a systematic literature review
Panzer, M., & Bender, B. (2022) · International Journal of Production Research · doi:10.1080/00207543.2021.1973138 · Cited by 282
Li, Y., Gu, W., Yuan, M., & Tang, Y. (2022) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2021.102283 · Cited by 261
Dynamic multi-objective scheduling for flexible job shop by deep reinforcement learning
Luo, S., Zhang, L., & Fan, Y. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107489 · Cited by 255
Self-citation
Metadata
- Authors
- Luo, S.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2020-06
- Volume
- 91
- Pages
- 106208
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W3009389630
- Cited by
- 579
- References
- 31
- FWCI
- 35.16
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.