A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem
The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
As an important branch of production scheduling, flexible job-shop scheduling problem (FJSP) is difficult to solve and is proven to be NP-hard. Many intelligent algorithms have been proposed to solve FJSP, but their key parameters cannot be dynamically adjusted effectively during the calculation process, which causes the solution efficiency and quality not being able to meet the production requirements. Therefore, a self-learning genetic algorithm (SLGA) is proposed in this paper, in which genetic algorithm (GA) is adopted as the basic optimization method and its key parameters are intelligently adjusted based on reinforcement learning (RL). Firstly, the self-learning model is analyzed and constructed in SLGA, SARSA algorithm and Q-Learning algorithm are applied as the learning methods at initial and later stages of optimization, respectively, and the conversion condition is designed. Secondly, the state determination method and reward method are designed for RL in GA environment. Finally, the learning effect and performance of SLGA in solving FJSP are compared with other algorithms using two groups of benchmark data instances with different scales. Experiment results show that the proposed SLGA significantly outperforms its competitors in solving FJSP.
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
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Routing and scheduling in a flexible job shop by tabu search
Brandimarte, P. (1993) · Annals of Operations Research · doi:10.1007/bf02023073 · Cited by 1,322
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Pezzella, F., Morganti, G., & Ciaschetti, G. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2007.02.014 · Cited by 1,014
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Xia, W., & Wu, Z. (2005) · Computers & Industrial Engineering · doi:10.1016/j.cie.2005.01.018 · Cited by 681
An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
Li, X., & Gao, L. (2016) · International Journal of Production Economics · doi:10.1016/j.ijpe.2016.01.016 · Cited by 618
Zhang, G., Shao, X., Li, P., & Gao, L. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2008.07.021 · Cited by 513
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
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
Gao, K., Yang, F., Zhou, M., Pan, Q., & Suganthan, P. N. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2817240 · Cited by 302
Tree Growth Algorithm (TGA): A novel approach for solving optimization problems
Cheraghalipour, A., Hajiaghaei-Keshteli, M., & Paydar, M. M. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2018.04.021 · Cited by 239
Experienced Gray Wolf Optimization Through Reinforcement Learning and Neural Networks
Emary, E., Zawbaa, H. M., & Grosan, C. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2634548 · Cited by 222
An effective architecture for learning and evolving flexible job-shop schedules
Ho, N. B., Tay, J. C., & Lai, E. M.-K. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.007 · Cited by 216
Qin, J., Li, M., Shi, Y., Ma, Q., & Zheng, W. X. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2832025 · Cited by 172
Backward Q-learning: The combination of Sarsa algorithm and Q-learning
Wang, Y.-H., Li, T.-H. S., & Lin, C.-J. (2013) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2013.06.016 · Cited by 164
Alipour, M. M., Razavi, S. N., Feizi‐Derakhshi, M., & Balafar, M. A. (2017) · Neural Computing and Applications · doi:10.1007/s00521-017-2880-4 · Cited by 123
A machine-learning approach to multi-robot coordination
Wang, Y., & de Silva, C. W. (2007) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2007.05.006 · Cited by 83
An efficient knowledge-based algorithm for the flexible job shop scheduling problem
Karimi, H., Rahmati, S. H. A., & Zandieh, M. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2012.04.001 · Cited by 66
Adaptive and large-scale service composition based on deep reinforcement learning
Wang, H., Gu, M., Yu, Q., Tao, Y., Li, J., Fei, H., Jia, Y., Zhao, W. Z., & Hong, T. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.05.020 · Cited by 63
An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem
Al‐Hinai, N., & ElMekkawy, T. Y. (2010) · Flexible Services and Manufacturing Journal · doi:10.1007/s10696-010-9067-y · Cited by 60
A Q-learning-based swarm optimization algorithm for economic dispatch problem
Hsieh, Y., & Su, M. (2015) · Neural Computing and Applications · doi:10.1007/s00521-015-2070-1 · Cited by 59
Wang, F., Zhou, L., Ren, H., & Liu, X. (2017) · Energies · doi:10.3390/en10121936 · Cited by 47
Improved Genetic Algorithm to Reduce Mutation Testing Cost
Bashir, M. B., & Nadeem, A. (2017) · IEEE Access · doi:10.1109/access.2017.2678200 · Cited by 45
Cited by
Genetic algorithms: theory, genetic operators, solutions, and applications
Alhijawi, B., & Awajan, A. (2024) · Evolutionary Intelligence · doi:10.1007/s12065-023-00822-6 · Cited by 723
Flexible Job-Shop Scheduling via Graph Neural Network and Deep Reinforcement Learning
Song, W., Chen, X., Li, Q., & Cao, Z. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3189725 · Cited by 519
Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A. M., & Talbi, E.-G. (2022) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.04.032 · Cited by 462
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
Scientometric Analysis of Quantum Algorithms for VANET Optimization
Pooja, & Kumar Sood, S. (2024) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2024.3428707 · Cited by 9
Metadata
- Authors
- Chen, R., Yang, B., Li, S., & Wang, S.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2020-11
- Volume
- 149
- Pages
- 106778
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W3082377584
- Cited by
- 548
- References
- 22
- FWCI
- 32.92
- 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.