The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
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
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
Genetic Algorithms and Random Keys for Sequencing and Optimization
Bean, J. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.154 · Cited by 1,543
Optimal power flow using particle swarm optimization
Abido, M. A. (2002) · International Journal of Electrical Power & Energy Systems · doi:10.1016/s0142-0615(01)00067-9 · Cited by 1,212
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
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
Machine 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
Cooperative learning in neural networks using particle swarm optimizers
van den Bergh, F., & Engelbrecht, A. P. (2000) · Cited by 320
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
Reeves, C. R. (1993) · Cited by 229
Particle swarm optimization algorithm for single machine total weighted tardiness problem
Tasgetiren, M. F., Sevkli, M., Liang, Y.-C., & Gencyilmaz, G. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331062 · Cited by 216
Self-citationOnwubolu, G. C., & Clerc, M. (2004) · International Journal of Production Research · doi:10.1080/00207540310001614150 · Cited by 179
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-citationParticle swarm optimization - mass-spring system analogon
Brandstätter, B., & Baumgartner, U. (2002) · IEEE Transactions on Magnetics · doi:10.1109/20.996256 · Cited by 124
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
梁音勻嘉, Tasgetiren, M. F., Şevkli, M., & Gençyılmaz, G. (2004) · Cited by 41
Self-citation
Cited by
Pandey, S., Wu, L., Guru, S. M., & Buyya, R. (2010) · 2010 24th IEEE International Conference on Advanced Information Networking and Applications · doi:10.1109/aina.2010.31 · Cited by 880
Variable neighbourhood search: methods and applications
Hansen, P., Mladenović, N., & Moreno Pérez, J. A. (2010) · Annals of Operations Research · doi:10.1007/s10479-009-0657-6 · Cited by 860
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-citationA novel particle swarm optimization algorithm with Levy flight
Haklı, H., & Uğuz, H. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.06.034 · Cited by 426
Jarboui, B., Damak, N., Siarry, P., & Rebai, A. (2008) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.04.096 · Cited by 307
Metadata
- Authors
- Tasgetiren, M. F., Liang, Y.-C., Sevkli, M., & Gencyilmaz, G.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2007-03
- Volume
- 177
- Issue
- 3
- Pages
- 1930-1947
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W1970320473
- Cited by
- 557
- References
- 25
- FWCI
- 106.87
- 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.