The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
A Simple Sequentially Rejective Multiple Test Procedure
(1979) · Scandinavian Journal of Statistics · doi:10.2307/4615733 · Cited by 21,526
Price, K. V. (2004) · Cited by 3,344
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
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
A comprehensive review and evaluation of permutation flowshop heuristics
Ruiz, R., & Maroto, C. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.04.017 · Cited by 579
Tasgetiren, M. F., Liang, Y.-C., Sevkli, M., & Gencyilmaz, G. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.12.024 · Cited by 557
Self-citationPalmer, D. S. (1965) · Journal of the Operational Research Society · doi:10.1057/jors.1965.8 · Cited by 547
Machine Scheduling Problems: Classification, complexity and computations
Kan, R. (1976) · Medical Entomology and Zoology · Cited by 478
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
A discrete version of particle swarm optimization for flowshop scheduling problems
Liao, C.-J., Tseng, C.-T., & Luarn, P. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.11.017 · Cited by 445
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Pan, Q.-K., Fatih Tasgetiren, M., & Liang, Y.-C. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2006.12.030 · Cited by 445
Self-citationMachine scheduling problems: Classification, complexity and computations
Rand, G. K. (1977) · European Journal of Operational Research · doi:10.1016/0377-2217(77)90029-7 · Cited by 342
Scheduling flow shops using differential evolution algorithm
Onwubolu, G., & Davendra, D. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.08.043 · Cited by 328
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
Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem
Tasgetiren, M. F., Şevkli, M., Liang, Y.-C., & Gençyılmaz, G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28646-2_38 · Cited by 144
Self-citationLian, Z., Gu, X., & Jiao, B. (2005) · Applied Mathematics and Computation · doi:10.1016/j.amc.2005.07.042 · Cited by 135
Watson, J., Barbulescu, L. V., Whitley, L. D., & Howe, A. E. (2002) · INFORMS journal on computing · doi:10.1287/ijoc.14.2.98.120 · Cited by 118
Rameshkumar, K., Suresh, R., & Sundaram, K. M. (2005) · Lecture notes in computer science · doi:10.1007/11539902_70 · Cited by 89
Tasgetiren, M. F., Pan, Q.-K., Suganthan, P. N., & Liang, Y.-C. (2007) · IEEE Symposium on Computational Intelligence in Scheduling (CISched) · doi:10.1109/scis.2007.367698 · Cited by 53
Self-citationDifferential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion
梁音勻嘉, Tasgetiren, M. F., Şevkli, M., & Gençyılmaz, G. (2004) · Cited by 36
Self-citationTasgetiren, M. F., Pan, Q.-K., Liang, Y.-C., & Suganthan, P. N. (2007) · IEEE Symposium on Computational Intelligence in Scheduling (CISched) · doi:10.1109/scis.2007.367701 · Cited by 31
Self-citationPan, Q.-K., Tasgetiren, M. F., & Liang, Y.-C. (2006) · Lecture notes in computer science · doi:10.1007/11839088_46 · Cited by 29
Self-citationPan, Q.-K., Tasgetiren, M. F., & Liang, Y.-C. (2007) · Springer eBooks · doi:10.1007/978-1-84628-663-6_2 · Cited by 28
Self-citation
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Comparison of Three Evolutionary Algorithms: GA, PSO, and DE
Kachitvichyanukul, V. (2012) · Industrial Engineering and Management Systems · doi:10.7232/iems.2012.11.3.215 · Cited by 355
Duman, E., Uysal, M., & Alkaya, A. F. (2012) · Information Sciences · doi:10.1016/j.ins.2012.06.032 · Cited by 286
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Wang, L., Pan, Q.-K., Suganthan, P. N., Wang, W.-H., & Wang, Y.-M. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2008.12.004 · Cited by 254
Self-citation
Metadata
- Authors
- Pan, Q.-K., Tasgetiren, M. F., & Liang, Y.-C.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2008-11
- Volume
- 55
- Issue
- 4
- Pages
- 795-816
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W1975172421
- Cited by
- 295
- References
- 27
- FWCI
- 47.61
- 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.