The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Automatic Design of Scheduling Policies for Dynamic Multi-objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming
Abstract
A scheduling policy strongly influences the performance of a manufacturing system. However, the design of an effective scheduling policy is complicated and time consuming due to the complexity of each scheduling decision, as well as the interactions among these decisions. This paper develops four new multi-objective genetic programming-based hyperheuristic (MO-GPHH) methods for automatic design of scheduling policies, including dispatching rules and due-date assignment rules in job shop environments. In addition to using three existing search strategies, nondominated sorting genetic algorithm II, strength Pareto evolutionary algorithm 2, and harmonic distance-based multi-objective evolutionary algorithm, to develop new MO-GPHH methods, a new approach called diversified multi-objective cooperative evolution (DMOCC) is also proposed. The novelty of these MO-GPHH methods is that they are able to handle multiple scheduling decisions simultaneously. The experimental results show that the evolved Pareto fronts represent effective scheduling policies that can dominate scheduling policies from combinations of existing dispatching rules with dynamic/regression-based due-date assignment rules. The evolved scheduling policies also show dominating performance on unseen simulation scenarios with different shop settings. In addition, the uniformity of the scheduling policies obtained from the proposed method of DMOCC is better than those evolved by other evolutionary approaches.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Design and Analysis of Experiments
Grice, J. V., & Montgomery, D. C. (2000) · Technometrics · doi:10.2307/1271458 · Cited by 2,654
Panwalkar, S. S., & Iskander, W. (1977) · Operations Research · doi:10.1287/opre.25.1.45 · Cited by 1,294
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
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Potter, M. A., & Jong, K. A. D. (2000) · Evolutionary Computation · doi:10.1162/106365600568086 · Cited by 1,196
Genetic Programming: An Introduction
Banzhaf, W., Keller, R. E., & Nordin, P. C. (1997) · Cited by 1,052
A survey of dynamic scheduling in manufacturing systems
Ouelhadj, D., & Petrović, S. (2008) · Journal of Scheduling · doi:10.1007/s10951-008-0090-8 · Cited by 1,031
SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization
Zitzler, E., Giannakoglou, K., Tsahalis, D., Periaux, J., Papailiou, K., (eds, T. F., Ler, E. Z., Laumanns, M., & Thiele, L. (2002) · Cited by 1,010
A Fast Taboo Search Algorithm for the Job Shop Problem
Nowicki, E., & Smutnicki, C. (1996) · Management Science · doi:10.1287/mnsc.42.6.797 · Cited by 976
Banzhaf, W., Fogarty, T. C., Schoenauer, M., & Poli, R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055923 · Cited by 825
A hybrid genetic algorithm for the job shop scheduling problem
Gonçalves, J. F., Mendes, J. J. D. M., & Resende, M. G. C. (2004) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.03.012 · Cited by 646
A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization
Goh, C.-K., & Tan, K. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.920671 · Cited by 592
Self-citationPriority Rules for Job Shops with Weighted Tardiness Costs
Vepsalainen, A. P. J., & Morton, T. E. (1987) · Management Science · doi:10.1287/mnsc.33.8.1035 · Cited by 577
Sequencing Rules and Due-Date Assignments in a Job Shop
Baker, K. R. (1984) · Management Science · doi:10.1287/mnsc.30.9.1093 · Cited by 496
Tay, J. C., & Ho, N. B. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.08.008 · Cited by 471
Multiobjective evolutionary algorithm test suites
van Veldhuizen, D. A., & Lamont, G. B. (1999) · Proceedings of the 1999 ACM symposium on Applied computing · doi:10.1145/298151.298382 · Cited by 447
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Balas, E., & Vazacopoulos, A. (1998) · Management Science · doi:10.1287/mnsc.44.2.262 · Cited by 407
Wiley Encyclopedia of Electrical and Electronics Engineering
Webster, J. G. (1999) · Wiley eBooks · doi:10.1002/047134608x · Cited by 358
Cheng, R., Gen, M., & Tsujimura, Y. (1999) · Computers & Industrial Engineering · doi:10.1016/s0360-8352(99)00022-4 · Cited by 323
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
Cheng, R., Gen, M., & Tsujimura, Y. (1999) · Computers & Industrial Engineering · doi:10.1016/s0360-8352(99)00136-9 · Cited by 303
Pareto-Front Exploration with Uncertain Objectives
Teich, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44719-9_22 · Cited by 262
Reliability-Based Optimization Using Evolutionary Algorithms
Deb, K., Gupta, S., Daum, D., Branke, J., Mall, A. K., & Padmanabhan, D. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014361 · Cited by 242
A distributed Cooperative coevolutionary algorithm for multiobjective optimization
Tan, K. C., Yang, Y. J., & Goh, C. K. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.860762 · Cited by 235
Self-citationJob-Shop Scheduling Theory: What Is Relevant?
McKay, K. N., Safayeni, F. R., & Buzacott, J. A. (1988) · Interfaces · doi:10.1287/inte.18.4.84 · Cited by 225
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-citationParallel GRASP with path-relinking for job shop scheduling
Aiex, R. M., Binato, S., & Resende, M. G. C. (2003) · Parallel Computing · doi:10.1016/s0167-8191(03)00014-0 · Cited by 218
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
Evolutionary Multi-objective Ranking with Uncertainty and Noise
Hughes, E. J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44719-9_23 · Cited by 206
Fifty years of scheduling: a survey of milestones
Potts, C. N., & Strusevich, V. A. (2009) · Journal of the Operational Research Society · doi:10.1057/jors.2009.2 · Cited by 200
An Investigation on Noisy Environments in Evolutionary Multiobjective Optimization
Goh, C. K., & Tan, K. C. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.882428 · Cited by 186
Self-citationSurvey of Job Shop Scheduling Techniques
Jones, A., Rabelo, L. C., & Sharawi, A. T. (1999) · Wiley Encyclopedia of Electrical and Electronics Engineering · doi:10.1002/047134608x.w3352 · Cited by 169
A simulation analysis of due date assignment rules
Ragatz, G. L., & Mabert, V. A. (1984) · Journal of Operations Management · doi:10.1016/0272-6963(84)90005-6 · Cited by 165
Manufacturing lead time estimation using data mining
Öztürk, A., Kayalıgil, S., & Özdemirel, N. E. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.03.015 · Cited by 142
Dynamic Scheduling with Genetic Programming
Jakobović, D., & Budin, L. (2006) · Lecture notes in computer science · doi:10.1007/11729976_7 · Cited by 136
Job shop scheduling with setup times, deadlines and precedence constraints
Balas, E., Simonetti, N., & Vazacopoulos, A. (2008) · Journal of Scheduling · doi:10.1007/s10951-008-0067-7 · Cited by 102
Due Date Assignment, Job Order Release, and Sequencing Interaction in Job Shop Scheduling*
Ahmed, I., & Fisher, W. W. (1992) · Decision Sciences · doi:10.1111/j.1540-5915.1992.tb00409.x · Cited by 65
Cited by
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-citationAutomated 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-citationA Steady-State and Generational Evolutionary Algorithm for Dynamic Multiobjective Optimization
Jiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2574621 · Cited by 364
A Survey on Cooperative Co-Evolutionary Algorithms
Ma, X., Li, X., Zhang, Q., Tang, K., Liang, Z., Xie, W., & Zhu, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2868770 · Cited by 336
Evolutionary Dynamic Multiobjective Optimization Via Kalman Filter Prediction
Muruganantham, A., Tan, K. C., & Vadakkepat, P. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2490738 · Cited by 314
Self-citation
Metadata
- Authors
- Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2014-04
- Volume
- 18
- Issue
- 2
- Pages
- 193-208
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2087376002
- Cited by
- 272
- References
- 41
- FWCI
- 33.99
- 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.