Surrogate-Assisted Evolutionary Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Dynamic flexible job shop scheduling (JSS) is an important combinatorial optimization problem with complex routing and sequencing decisions under dynamic environments. Genetic programming (GP), as a hyperheuristic approach, has been successfully applied to evolve scheduling heuristics for JSS. However, its training process is time consuming, and it faces the retraining problem once the characteristics of job shop scenarios vary. It is known that multitask learning is a promising paradigm for solving multiple tasks simultaneously by sharing knowledge among the tasks. To improve the training efficiency and effectiveness, this article proposes a novel surrogate-assisted evolutionary multitask algorithm via GP to share useful knowledge between different scheduling tasks. Specifically, we employ the phenotypic characterization for measuring the behaviors of scheduling rules and building a surrogate for each task accordingly. The built surrogates are used not only to improve the efficiency of solving each single task but also for knowledge transfer in multitask learning with a large number of promising individuals. The results show that the proposed algorithm can significantly improve the quality of scheduling heuristics for all scenarios. In addition, the proposed algorithm manages to solve multiple tasks collaboratively in terms of the evolved scheduling heuristics for different tasks in a multitask scenario.
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
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001 · cited 1×
“Approximate solu-tion optimisation methods such as simulated annealing [11], tabu search [12] and genetic algorithms [13], which aim to find a near-optimal solution, have been widely applied to JSS.”
Method
Cited by
Dynamic Auxiliary Task-Based Evolutionary Multitasking for Constrained Multiobjective Optimization
Qiao, K., Yu, K., Qu, B., Liang, J., Song, H., Yue, C., Lin, H., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3175065 · Cited by 253
Self-citationKumar, M., Dubey, K., Singh, S., Kumar Samriya, J., & Gill, S. S. (2023) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.7469 · Cited by 26
“Several meta-heuristic techniques 23–26 have been applied in diverse domains such as industry, academic, research, and business to solve the NP-complete problem, 2728 combinatorial optimization, 29 pattern recognition, 30 anti-collision problems, 31 and robot motion.”
Method
Metadata
- Authors
- Zhang, F., Mei, Y., Nguyen, S., Zhang, M., & Tan, K. C.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2021-08
- Volume
- 25
- Issue
- 4
- Pages
- 651-665
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W3136165312
- Cited by
- 233
- References
- 1
- FWCI
- 21.81
- 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: Surrogate-Assisted Evolutionary Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling. https://app.cochat.ai/papers/10.1109/tevc.2021.3065707
- The paper
- Zhang, F., Mei, Y., Nguyen, S., Zhang, M., & Tan, K. C. (2021). Surrogate-Assisted Evolutionary Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2021.3065707
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.