The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A comprehensive review and evaluation of permutation flowshop heuristics
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
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
Optimal two‐ and three‐stage production schedules with setup times included
Johnson, S. M. (1954) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800010110 · Cited by 3,252
Introduction to Sequencing and Scheduling
Clewett, A. J., & Baker, K. R. (1977) · Operational Research Quarterly (1970-1977) · doi:10.2307/3009192 · Cited by 2,597
Benchmarks for basic scheduling problems
Taillard, É. D. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90182-m · Cited by 2,489
Conway, R. W., Maxwell, W., & Miller, L. W. (1967) · Cited by 2,167
Design and Analysis of Experiments
(2001) · Technometrics · doi:10.1198/tech.2001.s605 · Cited by 1,271
A genetic algorithm for flowshop sequencing
Reeves, C. R. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0014-k · Cited by 872
Some efficient heuristic methods for the flow shop sequencing problem
Taillard, É. D. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90090-x · Cited by 869
Simulated annealing for permutation flow-shop scheduling
Osman, I., & Potts, C. (1989) · Omega · doi:10.1016/0305-0483(89)90059-5 · Cited by 614
Palmer, D. S. (1965) · Journal of the Operational Research Society · doi:10.1057/jors.1965.8 · Cited by 547
A fast tabu search algorithm for the permutation flow-shop problem
Nowicki, E., & Smutnicki, C. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00037-2 · Cited by 455
Ogbu, F. A., & Smith, D. K. (1990) · Computers & Operations Research · doi:10.1016/0305-0548(90)90001-n · Cited by 310
Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem
Reeves, C. R., & Yamada, T. (1998) · Evolutionary Computation · doi:10.1162/evco.1998.6.1.45 · Cited by 251
Heuristics for flow-shop scheduling
KING, J. R., & SPACHIS, A. S. (1980) · International Journal of Production Research · doi:10.1080/00207548008919673 · Cited by 197
A tabu search approach for the flow shop scheduling problem
Ben‐Daya, M., & Al-Fawzan, M. A. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00136-7 · Cited by 160
Parallel Processing and Applied Mathematics
Wyrzykowski, R., Waśniewski, J., Paprzycki, M., & Dongarra, J. J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-48086-2 · Cited by 17
Cited by
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., & Stützle, T. (2016) · Operations Research Perspectives · doi:10.1016/j.orp.2016.09.002 · Cited by 1,761
Iterated Local Search: Framework and Applications
Lourenço, H. R., Martin, O. C., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_12 · Cited by 571
An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling
Liu, B., Wang, L., & Jin, Y.-H. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883272 · Cited by 480
Flowshop-scheduling problems with makespan criterion: a review
Reza Hejazi *, S., & Saghafian, S. (2005) · International Journal of Production Research · doi:10.1080/0020754050056417 · Cited by 342
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
Pan, Q.-K., Tasgetiren, M. F., & Liang, Y.-C. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2008.03.003 · Cited by 295
Metadata
- Authors
- Ruiz, R., & Maroto, C.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2005-09
- Volume
- 165
- Issue
- 2
- Pages
- 479-494
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W1993433489
- Cited by
- 579
- References
- 17
- FWCI
- 58.34
- 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.