The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Particle swarm optimization algorithm for single machine total weighted tardiness problem
Abstract
In This work we present a particle swarm optimization algorithm to solve the single machine total weighted tardiness problem. A heuristic rule, the smallest position value (SPV) rule, is developed to enable the continuous particle swarm optimization algorithm to be applied to all classes of sequencing problems, which are NP-hard in the literature. A simple but very efficient local search method is embedded in the particle swarm optimization algorithm. The computational results show that the particle swarm algorithm is able to find the optimal and best-known solutions on all instances of widely used benchmarks from the OR library.
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
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
Cited by
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-citationBanks, A., Vincent, J., & Anyakoha, C. (2008) · Natural Computing · doi:10.1007/s11047-007-9050-z · Cited by 472
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-citationPSO-based algorithm for home care worker scheduling in the UK
Akjiratikarl, C., Yenradee, P., & Drake, P. R. (2007) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.06.002 · Cited by 296
Metadata
- Authors
- Tasgetiren, M. F., Sevkli, M., Liang, Y.-C., & Gencyilmaz, G.
- Venue
- Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
- Publisher
- IEEE
- Published
- 2005-01-17
- Pages
- 1412-1419
- OpenAlex
- W2157418816
- Cited by
- 216
- References
- 1
- FWCI
- 48.09
- Type
- conference paper
- 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.