The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
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
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 3,326
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Routing and scheduling in a flexible job shop by tabu search
Brandimarte, P. (1993) · Annals of Operations Research · doi:10.1007/bf02023073 · Cited by 1,322
Panwalkar, S. S., & Iskander, W. (1977) · Operations Research · doi:10.1287/opre.25.1.45 · Cited by 1,294
A state-of-the-art survey of dispatching rules for manufacturing job shop operations
BLACKSTONE, J. H., PHILLIPS, D. T., & HOGG, G. L. (1982) · International Journal of Production Research · doi:10.1080/00207548208947745 · Cited by 1,013
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
An Algorithm for Solving the Job-Shop Problem
Carlier, J., & Pinson, É. (1989) · Management Science · doi:10.1287/mnsc.35.2.164 · Cited by 824
Kacem, I., Hammadi, S., & Borne, P. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2002.1009117 · Cited by 788
Deterministic job-shop scheduling: Past, present and future
Jain, A. S., & Meeran, S. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00113-1 · Cited by 782
Ishibuchi, H., Yoshida, T., & Murata, T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810752 · Cited by 773
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
Automated synthesis of analog electrical circuits by means of genetic programming
Koza, J. R., Bennett, F. H., André, D., Keane, M. A., & Dunlap, F. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.687879 · Cited by 465
Statistics, Principles and Methods
Booth, D. E. (1993) · Technometrics · doi:10.1080/00401706.1993.10485068 · Cited by 433
Recent Trends in Evolutionary Multiobjective Optimization
Coello Coello, C. A. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_2 · Cited by 166
GENACE: an efficient cultural algorithm for solving the flexible job-shop problem
Ho, N. B., & Tay, J. C. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2004.1331108 · Cited by 140
Self-citation
Cited by
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
An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
Li, X., & Gao, L. (2016) · International Journal of Production Economics · doi:10.1016/j.ijpe.2016.01.016 · Cited by 618
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
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
A research survey: review of flexible job shop scheduling techniques
Chaudhry, I. A., & Khan, A. A. (2016) · International Transactions in Operational Research · doi:10.1111/itor.12199 · Cited by 439
Metadata
- Authors
- Tay, J. C., & Ho, N. B.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2008-04
- Volume
- 54
- Issue
- 3
- Pages
- 453-473
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W2073870328
- Cited by
- 471
- References
- 20
- FWCI
- 45.80
- 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.