The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Automated Design of Production Scheduling Heuristics: A Review
Open accessAbstract
Hyper-heuristics have recently emerged as a powerful approach to automate the design of heuristics for a number of different problems. Production scheduling is a particularly popular application area for which a number of different hyper-heuristics have been developed and are shown to be effective, efficient, easy to implement, and reusable in different shop conditions. In particular, they seem to be a promising way to tackle highly dynamic and stochastic scheduling problems, an aspect that is specifically emphasized in this survey. Despite their success and the substantial number of papers in this area, there is currently no systematic discussion of the design choices and critical issues involved in the process of developing such approaches. This paper strives to fill this gap by summarizing the state-of-the-art approaches, suggesting a taxonomy, and providing the interested researchers and practitioners with guidelines for the design of hyper-heuristics in production scheduling. This paper also identifies challenges and open questions and highlights various directions for future work.
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
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
OR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1057/jors.1990.166 · Cited by 1,899
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules
Fisher, H. F. (1963) · Medical Entomology and Zoology · Cited by 729
A Classification of Hyper-heuristic Approaches
Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_15 · Cited by 563
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1992) · Management Science · doi:10.1287/mnsc.38.10.1495 · Cited by 546
Tay, J. C., & Ho, N. B. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.08.008 · Cited by 471
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
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2248159 · Cited by 272
Self-citation
Cited by
Fogel, D. B. (2018) · Contemporary Clinical Trials Communications · doi:10.1016/j.conctc.2018.08.001 · Cited by 1,035
Recent advances in selection hyper-heuristics
Drake, J. H., Kheiri, A., Özcan, E., & Burke, E. K. (2020) · European Journal of Operational Research · doi:10.1016/j.ejor.2019.07.073 · Cited by 365
Zhang, F., Mei, Y., Nguyen, S., & Zhang, M. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3024849 · Cited by 264
Self-citationA review on the self and dual interactions between machine learning and optimisation
Song, H., Triguero, I., & Özcan, E. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00185-z · Cited by 101
Metadata
- Authors
- Branke, J., Nguyen, S., Pickardt, C. W., & Zhang, M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2016-02
- Volume
- 20
- Issue
- 1
- Pages
- 110-124
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2275596639
- Cited by
- 469
- References
- 32
- FWCI
- 56.82
- 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: Automated Design of Production Scheduling Heuristics: A Review. https://app.cochat.ai/papers/10.1109/tevc.2015.2429314
- The paper
- Branke, J., Nguyen, S., Pickardt, C. W., & Zhang, M. (2016). Automated Design of Production Scheduling Heuristics: A Review. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2015.2429314
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.