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-citationOR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1038/sj/jors/0411109 · Cited by 256
A Comparison of Bloat Control Methods for Genetic Programming
Luke, S., & Panait, L. (2006) · Evolutionary Computation · doi:10.1162/evco.2006.14.3.309 · Cited by 239
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2227326 · Cited by 221
Self-citationRapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach
Geiger, C. D., Uzsoy, R., & Aytuğ, H. (2006) · Journal of Scheduling · doi:10.1007/s10951-006-5591-8 · Cited by 217
On Using Surrogates with Genetic Programming
Hildebrandt, T., & Branke, J. (2015) · Evolutionary Computation · doi:10.1162/evco_a_00133 · Cited by 196
Self-citationHyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations
Branke, J., Hildebrandt, T., & Scholz‐Reiter, B. (2014) · Evolutionary Computation · doi:10.1162/evco_a_00131 · Cited by 146
Self-citationDiscovering Dispatching Rules Using Data Mining
Li, X., & Ólafsson, S. (2005) · Journal of Scheduling · doi:10.1007/s10951-005-4781-0 · Cited by 138
Dynamic Scheduling with Genetic Programming
Jakobović, D., & Budin, L. (2006) · Lecture notes in computer science · doi:10.1007/11729976_7 · Cited by 136
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277273 · Cited by 121
Automating the Packing Heuristic Design Process with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00044 · Cited by 114
A neural network job-shop scheduler
Weckman, G. R., Ganduri, C., & Koonce, D. A. (2008) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-008-0073-9 · Cited by 107
Learning effective new single machine dispatching rules from optimal scheduling data
Ólafsson, S., & Li, X. (2010) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.06.004 · Cited by 83
Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
Bader-El-Den, M. B., Poli, R., & Fatima, S. S. (2009) · Memetic Computing · doi:10.1007/s12293-009-0022-y · Cited by 69
Algebraic simplification of GP programs during evolution
Wong, P., & Zhang, M. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144156 · Cited by 56
Self-citationA mixed dispatching rule approach in FMS scheduling
Ishii, N., & Talavage, J. J. (1994) · International Journal of Flexible Manufacturing Systems · doi:10.1007/bf01324876 · Cited by 52
Vázquez-Rodríguez, J. A., & Ochoa, G. (2010) · Journal of the Operational Research Society · doi:10.1057/jors.2010.132 · Cited by 43
A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
El-Bouri, A. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.07.004 · Cited by 35
Kumar, R., Joshi, A. H., Banka, K. K., & Rockett, P. I. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389335 · Cited by 32
Policy matrix evolution for generation of heuristics
Özcan, E., & Parkes, A. J. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001846 · Cited by 31
Mascia, F., López‐Ibáñez, M., Dubois-Lacoste, J., & Stützle, T. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-44973-4_36 · Cited by 30
Shaw, M. J. (1989) · International Journal of Flexible Manufacturing Systems · doi:10.1007/bf00222707 · Cited by 21
Data-Mining-Driven Neighborhood Search
Samorani, M., & Laguna, M. (2011) · INFORMS journal on computing · doi:10.1287/ijoc.1110.0451 · Cited by 6
Cited by
Fogel, D. B. (2018) · Contemporary Clinical Trials Communications · doi:10.1016/j.conctc.2018.08.001 · Cited by 1,035
An Energy Efficient Ant Colony System for Virtual Machine Placement in Cloud Computing
Liu, X.-F., Zhan, Z.-H., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2623803 · Cited by 407
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
Genetic programming for production scheduling: a survey with a unified framework
Nguyen, S., Mei, Y., & Zhang, M. (2017) · Complex & Intelligent Systems · doi:10.1007/s40747-017-0036-x · Cited by 279
Self-citationZhang, F., Mei, Y., Nguyen, S., & Zhang, M. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3024849 · Cited by 264
Self-citation
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
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.