The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling 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
(1979) · Cited by 43,841
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
Probability and Statistics for Engineering and the Sciences.
Devore, J. L. (1991) · Biometrics · doi:10.2307/2532427 · Cited by 2,503
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
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
Design and Analysis of Experiments
Amidan, B., Dean, A., & Voss, D. (2000) · Technometrics · doi:10.2307/1271085 · Cited by 1,158
A genetic algorithm for flowshop sequencing
Reeves, C. R. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0014-k · Cited by 872
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Hall, N. G., & Sriskandarajah, C. (1996) · Operations Research · doi:10.1287/opre.44.3.510 · Cited by 842
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-citationDiscrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem
Clerc, M. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_8 · Cited by 462
Probability and Statistics for Engineering and the Sciences
Ziegel, E. R., & Devore, J. L. (1992) · Technometrics · doi:10.2307/1270073 · Cited by 338
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-citationHeuristics for flow-shop scheduling
KING, J. R., & SPACHIS, A. S. (1980) · International Journal of Production Research · doi:10.1080/00207548008919673 · Cited by 197
Onwubolu, 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-citationSolving the continuous flow-shop scheduling problem by metaheuristics
Fink, A., & Voß, S. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00834-2 · Cited by 141
Particle 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
Optimization Software Class Libraries
VoÃ, S., & Woodruff, D. L. (2002) · Operations research, computer science. Interface series · doi:10.1007/b101931 · Cited by 115
Optimization Software Class Libraries
Voß, S., & Woodruff, D. L. (2005) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48126-x_1 · Cited by 93
梁音勻嘉, Tasgetiren, M. F., Şevkli, M., & Gençyılmaz, G. (2004) · Cited by 41
Cited by
A 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
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
Chen, W.-N., Zhang, J., Chung, H. S. H., Zhong, W.-L., Wu, W.-G., & Shi, Y.-H. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2030331 · Cited by 423
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
Self-citationDuman, 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., Fatih Tasgetiren, M., & Liang, Y.-C.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2008-09
- Volume
- 35
- Issue
- 9
- Pages
- 2807-2839
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2052272326
- Cited by
- 445
- References
- 22
- FWCI
- 67.10
- 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.