The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Smart Manufacturing Scheduling With Edge Computing Using Multiclass Deep Q Network
Abstract
Manufacturing is involved with complex job shop scheduling problems (JSP). In smart factories, edge computing supports computing resources at the edge of production in a distributed way to reduce response time of making production decisions. However, most works on JSP did not consider edge computing. Therefore, this paper proposes a smart manufacturing factory framework based on edge computing, and further investigates the JSP under such a framework. With recent success of some AI applications, the deep Q network (DQN), which combines deep learning and reinforcement learning, has showed its great computing power to solve complex problems. Therefore, we adjust the DQN with an edge computing framework to solve the JSP. Different from the classical DQN with only one decision, this paper extends the DQN to address the decisions of multiple edge devices. Simulation results show that the proposed method performs better than the other methods using only one dispatching rule.
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
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
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
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
Benchmarks for basic scheduling problems
Taillard, É. D. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90182-m · Cited by 2,813
Panwalkar, S. S., & Iskander, W. (1977) · Operations Research · doi:10.1287/opre.25.1.45 · Cited by 1,294
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
A Computational Study of the Job-Shop Scheduling Problem
Applegate, D., & Cook, W. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.2.149 · Cited by 908
A reinforcement learning approach to job-shop scheduling
Zhang, W., & Dietterich, T. G. (1995) · Cited by 378
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
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
Selective Offloading in Mobile Edge Computing for the Green Internet of Things
Lyu, X., Tian, H., Jiang, L., Vinel, A., Maharjan, S., Gjessing, S., & Zhang, Y. (2018) · IEEE Network · doi:10.1109/mnet.2018.1700101 · Cited by 224
An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling
Ge, H., Sun, L., Liang, Y.-C., & Qian, F. (2008) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/tsmca.2007.914753 · Cited by 134
Delay constrained offloading for Mobile Edge Computing in cloud-enabled vehicular networks
Zhang, K., Mao, Y., Leng, S., Vinel, A. V., & Zhang, Y. (2016) · International Workshop on Resilient Networks Design and Modeling (RNDM) · doi:10.1109/rndm.2016.7608300 · Cited by 127
DRL-Scheduling: An Intelligent QoS-Aware Job Scheduling Framework for Applications in Clouds
Wei, Y., Pan, L., Liu, S., Wu, L., & Meng, X. (2018) · IEEE Access · doi:10.1109/access.2018.2872674 · Cited by 90
Edge Computing-Based Intelligent Manhole Cover Management System for Smart Cities
Jia, G., Han, G., Rao, H., & Shu, L. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2786349 · Cited by 84
Sharma, V., Song, F., You, I., & Atiquzzaman, M. (2017) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.08.013 · Cited by 73
Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling
Yu, H., & Liang, W. G. (2001) · Computers & Industrial Engineering · doi:10.1016/s0360-8352(01)00010-9 · Cited by 70
Liu, L., Chan, S., Han, G., Guizani, M., & Bandai, M. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2879513 · Cited by 39
Job shop scheduling based on ACO with a hybrid solution construction strategy
Tseng, S.-P., Tsai, C., Chen, J.-L., Chiang, M., & Yang, C. (2011) · IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) · doi:10.1109/fuzzy.2011.6007565 · Cited by 12
Cited by
Resource Scheduling in Edge Computing: A Survey
Luo, Q., Hu, S., Li, C., Li, G., & Shi, W. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3106401 · Cited by 588
Machine Learning for industrial applications: A comprehensive literature review
Bertolini, M., Mezzogori, D., Neroni, M., & Zammori, F. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114820 · Cited by 553
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
Industrial applications of digital twins
Jiang, Y., Yin, S., Li, K., Luo, H., & Kaynak, O. (2021) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2020.0360 · Cited by 398
Park, J., Chun, J., Kim, S. H., Kim, Y., & Park, J. (2021) · International Journal of Production Research · doi:10.1080/00207543.2020.1870013 · Cited by 329
Metadata
- Authors
- Lin, C.-C., Deng, D.-J., Chih, Y.-L., & Chiu, H.-T.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2019-07
- Volume
- 15
- Issue
- 7
- Pages
- 4276-4284
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2932097000
- Cited by
- 342
- References
- 20
- FWCI
- 23.42
- 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.