The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop 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
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
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
The particle swarm: social adaptation of knowledge
Kennedy, J. (2002) · Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) · doi:10.1109/icec.1997.592326 · Cited by 1,555
Recent approaches to global optimization problems through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Natural Computing · doi:10.1023/a:1016568309421 · Cited by 1,406
Routing and scheduling in a flexible job shop by tabu search
Brandimarte, P. (1993) · Annals of Operations Research · doi:10.1007/bf02023073 · Cited by 1,322
Kacem, I., Hammadi, S., & Borne, P. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2002.1009117 · Cited by 788
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Xia, W., & Wu, Z. (2005) · Computers & Industrial Engineering · doi:10.1016/j.cie.2005.01.018 · Cited by 681
Tabu search for the job-shop scheduling problem with multi-purpose machines
Hurink, J. L., Jurisch, B., & Thole, M. (1994) · OR Spectrum · doi:10.1007/bf01719451 · Cited by 599
Proceedings of IEEE International Conference on Evolutionary Computation
(1996) · doi:10.1109/icec.1996 · Cited by 489
Logistics of Production and Inventory
Rand, G. K. (1995) · Journal of the Operational Research Society · doi:10.1057/jors.1995.17 · Cited by 397
Tardiness minimization in a flexible job shop: A tabu search approach
Scrich, C. R., Armentano, V. A., & Laguna, M. (2003) · Journal of Intelligent Manufacturing · doi:10.1023/b:jims.0000010078.30713.e9 · Cited by 96
Proceedings of the 1998 IEEE International Conference on Evolutionary Computation [Book Review]
Kennedy, J. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.1999.771169 · Cited by 77
Cited by
Chen, R., Yang, B., Li, S., & Wang, S. (2020) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.106778 · Cited by 548
A research survey: review of flexible job shop scheduling techniques
Chaudhry, I. A., & Khan, A. A. (2016) · International Transactions in Operational Research · doi:10.1111/itor.12199 · Cited by 439
Moslehi, G., & Mahnam, M. (2011) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.08.004 · Cited by 313
Li, J.-Q., Pan, Q.-K., & Tasgetiren, M. F. (2014) · Applied Mathematical Modelling · doi:10.1016/j.apm.2013.07.038 · Cited by 273
Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
Yuan, Y., & Xu, H. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2274517 · Cited by 270
Metadata
- Authors
- Zhang, G., Shao, X., Li, P., & Gao, L.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2009-05
- Volume
- 56
- Issue
- 4
- Pages
- 1309-1318
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W1964674593
- Cited by
- 513
- References
- 16
- 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.