Learning-based scheduling of flexible manufacturing systems using ensemble methods
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Abstract Dispatching rules are commonly applied to schedule jobs in Flexible Manufacturing Systems (FMSs). However, the suitability of these rules relies heavily on the state of the system; hence, there is no single rule that always outperforms the others. In this scenario, machine learning techniques, such as support vector machines (SVMs), inductive learning-based decision trees (DTs), backpropagation neural networks (BPNs), and case based-reasoning (CBR), offer a powerful approach for dynamic scheduling, as they help managers identify the most appropriate rule in each moment. Nonetheless, different machine learning algorithms may provide different recommendations. In this research, we take the analysis one step further by employing ensemble methods, which are designed to select the most reliable recommendations over time. Specifically, we compare the behaviour of the bagging, boosting, and stacking methods. Building on the aforementioned machine learning algorithms, our results reveal that ensemble methods enhance the dynamic performance of the FMS. Through a simulation study, we show that this new approach results in an improvement of key performance metrics (namely, mean tardiness and mean flow time) over existing dispatching rules and the individual use of each machine learning algorithm.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
Wolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951 · cited 1×
“Three of the most widely used techniques are bagging (Breiman, 1996), boosting (Freund & Schapire, 1996; Schapire, 1990) and stacking (Wolpert, 1992).”
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600 · cited 1×
“Three of the most widely used techniques are bagging (Breiman, 1996), boosting (Freund & Schapire, 1996; Schapire, 1990) and stacking (Wolpert, 1992).”
Cited by
Machine learning and data mining in manufacturing
Dogan, A., & Birant, D. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114060 · Cited by 677
Artificial Intelligence in Advanced Manufacturing: Current Status and Future Outlook
Arinez, J. F., Chang, Q., Gao, R. X., Xu, C., & Zhang, J. (2020) · Journal of Manufacturing Science and Engineering · doi:10.1115/1.4047855 · Cited by 584
“[41,46 – 49]) is a typical source for training data, it suffers from the disadvantage that data might be biased if the simulation is incapable of representing real operations.”
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
Cavalcante, I. M., Frazzon, E. M., Forcellini, F. A., & Ivanov, D. (2019) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2019.03.004 · Cited by 527
Usuga Cadavid, J. P., Lamouri, S., Grabot, B., Pellerin, R., & Fortin, A. (2020) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-019-01531-7 · Cited by 387
Metadata
- Authors
- Priore, P., Ponte, B., Puente, J., & Gómez, A.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2018-12
- Volume
- 126
- Pages
- 282-291
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W2890760539
- Cited by
- 111
- References
- 5
- FWCI
- 8.31
- 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
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.