The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Flexible Job-Shop Scheduling via Graph Neural Network and Deep Reinforcement Learning
Open accessAbstract
Recently, deep reinforcement learning (DRL) has been applied to learn priority dispatching rules (PDRs) for solving complex scheduling problems. However, the existing works face challenges in dealing with flexibility, which allows an operation to be scheduled on one out of multiple machines and is often required in practice. Such one-to-many relationship brings additional complexity in both decision making and state representation. This article considers the well-known flexible job-shop scheduling problem and addresses these issues by proposing a novel DRL method to learn high-quality PDRs end to end. The operation selection and the machine assignment are combined as a composite decision. Moreover, based on a novel heterogeneous graph representation of scheduling states, a heterogeneous-graph-neural-network-based architecture is proposed to capture complex relationships among operations and machines. Experiments show that the proposed method outperforms traditional PDRs and is computationally efficient, even on instances of larger scales and different properties unseen in training.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Exploiting Generative AI to Scale up Intelligent Tutoring Systems
Jakubův, J., Chvalovský, K., Goertzel, Z., Kaliszyk, C., Olšák, M., Piotrowski, B., Schulz, S., Suda, M., & Urban, J. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itp.2023.19 · Cited by 76,658
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
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
MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding
Fu, X., Zhang, J., Meng, Z., & King, I. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380297 · Cited by 976
Liu, Z., & Zhou, J. (2020) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01587-8_7 · Cited by 806
Tabu search for the job-shop scheduling problem with multi-purpose machines
Hurink, J. L., Jurisch, B., & Thole, M. (1994) · OR Spectrum · doi:10.1007/bf01719451 · Cited by 599
Review of job shop scheduling research and its new perspectives under Industry 4.0
Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1350-2 · Cited by 558
Chen, R., Yang, B., Li, S., & Wang, S. (2020) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.106778 · Cited by 548
Yun, S., Jeong, M., Kim, R., Kang, J., & Kim, H. J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.06455 · Cited by 471
Metadata
- Authors
- Song, W., Chen, X., Li, Q., & Cao, Z.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2023-02
- Volume
- 19
- Issue
- 2
- Pages
- 1600-1610
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W4285024875
- Cited by
- 519
- References
- 32
- FWCI
- 39.28
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Flexible Job-Shop Scheduling via Graph Neural Network and Deep Reinforcement Learning. https://app.cochat.ai/papers/10.1109/tii.2022.3189725
- The paper
- Song, W., Chen, X., Li, Q., & Cao, Z. (2023). Flexible Job-Shop Scheduling via Graph Neural Network and Deep Reinforcement Learning. IEEE Transactions on Industrial Informatics. https://doi.org/10.1109/tii.2022.3189725
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.