The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Evolving Scheduling Heuristics via Genetic Programming With Feature Selection in Dynamic Flexible Job-Shop Scheduling
Abstract
Dynamic flexible job-shop scheduling (DFJSS) is a challenging combinational optimization problem that takes the dynamic environment into account. Genetic programming hyperheuristics (GPHH) have been widely used to evolve scheduling heuristics for job-shop scheduling. A proper selection of the terminal set is a critical factor for the success of GPHH. However, there is a wide range of features that can capture different characteristics of the job-shop state. Moreover, the importance of a feature is unclear from one scenario to another. The irrelevant and redundant features may lead to performance limitations. Feature selection is an important task to select relevant and complementary features. However, little work has considered feature selection in GPHH for DFJSS. In this article, a novel two-stage GPHH framework with feature selection is designed to evolve scheduling heuristics only with the selected features for DFJSS automatically. Meanwhile, individual adaptation strategies are proposed to utilize the information of both the selected features and the investigated individuals during the feature selection process. The results show that the proposed algorithm can successfully achieve more interpretable scheduling heuristics with fewer unique features and smaller sizes. In addition, the proposed algorithm can reach comparable scheduling heuristic quality with much shorter training time.
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
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Feature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Kennedy, J. (2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_630 · Cited by 2,989
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Explaining Explanations: An Overview of Interpretability of Machine Learning
Gilpin, L. H., Bau, D., Yuan, B. Z., Bajwa, A., Specter, M., & Kagal, L. (2018) · 2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa.2018.00018 · Cited by 2,507 · cited 1×
“As a result, the evolved rules tend to have a large number of different features, making it hard to interpret the rules [22].”
BackgroundDowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
A Field Guide to Genetic Programming
Poli, R., Langdon, W. B., & McPhee, N. F. (2008) · Cited by 1,930
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841
Self-citationHandbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
Developing Theory Through Simulation Methods
Davis, J. P., Eisenhardt, K. M., & Bingham, C. B. (2007) · Academy of Management Review · doi:10.5465/amr.2007.24351453 · Cited by 1,157
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Simulated Annealing: Theory and Applications · doi:10.1007/978-94-015-7744-1_2 · Cited by 832
On the Job-Shop Scheduling Problem
Manne, A. S. (1960) · Operations Research · doi:10.1287/opre.8.2.219 · Cited by 666
Tay, J. C., & Ho, N. B. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.08.008 · Cited by 471
Automated Design of Production Scheduling Heuristics: A Review
Branke, J., Nguyen, S., Pickardt, C. W., & Zhang, M. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2429314 · Cited by 469
Self-citationFeature selection via a novel chaotic crow search algorithm
Sayed, G. I., Hassanien, A. E., & Azar, A. T. (2019) · Neural Computing and Applications · doi:10.1007/s00521-017-2988-6 · Cited by 459
Glover, F., & Laguna, M. (1998) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4613-0303-9_33 · Cited by 428
Feature selection for high-dimensional classification using a competitive swarm optimizer
Gu, S., Cheng, R., & Jin, Y. (2018) · Soft Computing · doi:10.1007/s00500-016-2385-6 · Cited by 360
Exploring Hyper-heuristic Methodologies with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Ozcan, E., & Woodward, J. R. (2009) · Intelligent Systems Reference Library · doi:10.1007/978-3-642-01799-5_6 · Cited by 304
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-citationRobust scheduling for multi-objective flexible job-shop problems with random machine breakdowns
Xiong, J., Xing, L.-N., & Chen, Y.-W. (2013) · International Journal of Production Economics · doi:10.1016/j.ijpe.2012.04.015 · Cited by 228
Rapid 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
Hybrid particle swarm optimization with spiral-shaped mechanism for feature selection
Chen, K., Zhou, F.-Y., & Yuan, X.-F. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.03.039 · Cited by 204
On Using Surrogates with Genetic Programming
Hildebrandt, T., & Branke, J. (2015) · Evolutionary Computation · doi:10.1162/evco_a_00133 · Cited by 196
Jurado, S., Nebot, À., Mugica, F., & Avellana, N. (2015) · Energy · doi:10.1016/j.energy.2015.04.039 · Cited by 195
An improved global feature selection scheme for text classification
Uysal, A. K. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.08.050 · Cited by 194
Nag, K., & Pal, N. R. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2404806 · Cited by 193
Chen, Q., Zhang, M., & Xue, B. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2683489 · Cited by 169
Self-citationAutomatic Programming via Iterated Local Search for Dynamic Job Shop Scheduling
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2317488 · Cited by 160
Self-citationA Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics
Burke, E. K., Hyde, M., Kendall, G., & Woodward, J. R. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2041061 · Cited by 155
Mei, Y., Nguyen, S., Xue, B., & Zhang, M. (2017) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2017.2743758 · Cited by 124
Self-citationHybrid Feature Selection Method Based on the Genetic Algorithm and Pearson Correlation Coefficient
Saidi, R., Bouaguel, W., & Essoussi, N. (2018) · Studies in computational intelligence · doi:10.1007/978-3-030-02357-7_1 · Cited by 88
Zhang, F., Mei, Y., & Zhang, M. (2019) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3321707.3321790 · Cited by 70
Self-citationEvolving 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
Chen, Q., Zhang, M., & Xue, B. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2881392 · Cited by 52
Self-citationGenetic Programming for Evolving Due-Date Assignment Models in Job Shop Environments
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013) · Evolutionary Computation · doi:10.1162/evco_a_00105 · Cited by 42
Self-citationSurrogate-Assisted Genetic Programming for Dynamic Flexible Job Shop Scheduling
Zhang, F., Mei, Y., & Zhang, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03991-2_69 · Cited by 38
Self-citationAin, Q. U., Xue, B., Al-Sahaf, H., & Zhang, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-97304-3_56 · Cited by 32
Self-citationA Genetic Programming Hyper-Heuristic Approach to Automated Packing
Hyde, M. (2010) · Nottingham ePrints (University of Nottingham) · Cited by 20
Cited by
Deep reinforcement learning for dynamic scheduling of a flexible job shop
Liu, R., Piplani, R., & Toro, C. (2022) · International Journal of Production Research · doi:10.1080/00207543.2022.2058432 · Cited by 310
An Evolutionary Multitasking-Based Feature Selection Method for High-Dimensional Classification
Chen, K., Xue, B., Zhang, M., & Zhou, F. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3042243 · Cited by 263
Self-citationLi, Y., Gu, W., Yuan, M., & Tang, Y. (2022) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2021.102283 · Cited by 261
Metadata
- Authors
- Zhang, F., Mei, Y., Nguyen, S., & Zhang, M.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2021-04
- Volume
- 51
- Issue
- 4
- Pages
- 1797-1811
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W3093994124
- Cited by
- 264
- References
- 43
- FWCI
- 21.26
- 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.