The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A discrete version of particle swarm optimization for flowshop scheduling problems
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
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
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
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
Recent advances in particle swarm
Hu, X., Shi, Y., & Eberhart, R. (2004) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1330842 · Cited by 466
Cooperative learning in neural networks using particle swarm optimizers
van den Bergh, F., & Engelbrecht, A. P. (2000) · Cited by 320
Ant Colony Optimization for the Total Weighted Tardiness Problem
den Besten, M., Stützle, T., & Dorigo, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_60 · Cited by 219
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
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
梁音勻嘉, Tasgetiren, M. F., Şevkli, M., & Gençyılmaz, G. (2004) · Cited by 41
Cited by
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 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
Gong, M., Cai, Q., Chen, X., & Ma, L. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2260862 · Cited by 394
Jarboui, B., Damak, N., Siarry, P., & Rebai, A. (2008) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.04.096 · Cited by 307
Volleyball Premier League Algorithm
Moghdani, R., & Salimifard, K. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.043 · Cited by 301
Metadata
- Authors
- Liao, C.-J., Tseng, C.-T., & Luarn, P.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2007-10
- Volume
- 34
- Issue
- 10
- Pages
- 3099-3111
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2052115917
- Cited by
- 445
- References
- 12
- FWCI
- 44.02
- 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.