The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
Open accessOverview
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 fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Glover, F., & Laguna, M. (1997) · Cited by 5,679
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
On the performance of artificial bee colony (ABC) algorithm
Karaboga, D., & Basturk, B. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.05.007 · Cited by 3,672
A comparative study of Artificial Bee Colony algorithm
Karaboga, D., & Akay, B. (2009) · Applied Mathematics and Computation · doi:10.1016/j.amc.2009.03.090 · Cited by 3,206
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
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
Glover, F. (1990) · Interfaces · doi:10.1287/inte.20.4.74 · Cited by 1,092
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Pezzella, F., Morganti, G., & Ciaschetti, G. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2007.02.014 · Cited by 1,014
A Fast Taboo Search Algorithm for the Job Shop Problem
Nowicki, E., & Smutnicki, C. (1996) · Management Science · doi:10.1287/mnsc.42.6.797 · Cited by 976
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
Applying tabu search to the job-shop scheduling problem
Dell’Amico, M., & Trubian, M. (1993) · Annals of Operations Research · doi:10.1007/bf02023076 · Cited by 603
Gao, J., Sun, L., & Gen, M. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2007.01.001 · Cited by 539
Zhang, G., Shao, X., Li, P., & Gao, L. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2008.07.021 · Cited by 513
Tay, J. C., & Ho, N. B. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.08.008 · Cited by 471
Moslehi, G., & Mahnam, M. (2011) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.08.004 · Cited by 313
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Zhang, C., Li, P., Guan, Z., & Rao, Y. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2005.12.002 · Cited by 307
An artificial immune algorithm for the flexible job-shop scheduling problem
Bagheri, A., Zandieh, M., Mahdavi, I., & Yazdani, M. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2009.10.004 · Cited by 280
Li, J.-Q., Pan, Q.-K., & Gao, K.-Z. (2011) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-010-3140-2 · Cited by 244
Self-citationAn effective architecture for learning and evolving flexible job-shop schedules
Ho, N. B., Tay, J. C., & Lai, E. M.-K. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.007 · Cited by 216
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
Pan, Q.-K., Wang, L., & Qian, B. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2008.10.008 · Cited by 194
Self-citationMulti-objective flexible job shop schedule: Design and evaluation by simulation modeling
Xing, L., Chen, Y., & Yang, K. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2008.04.013 · Cited by 111
Cited by
A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems
Verma, S., Pant, M., & Snasel, V. (2021) · IEEE Access · doi:10.1109/access.2021.3070634 · Cited by 974
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
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
Gao, K., Yang, F., Zhou, M., Pan, Q., & Suganthan, P. N. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2817240 · Cited by 302
Self-citationLi, J.-Q., Sang, H.-Y., Han, Y.-Y., Wang, C.-G., & Gao, K.-Z. (2018) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2018.02.004 · Cited by 295
Self-citation
Metadata
- Authors
- Li, J.-Q., Pan, Q.-K., & Tasgetiren, M. F.
- Venue
- Applied Mathematical Modelling
- Publisher
- Elsevier BV
- Published
- 2014-02
- Volume
- 38
- Issue
- 3
- Pages
- 1111-1132
- ISSN
- 0307-904X (ISSN-L)
- OpenAlex
- W2006785664
- Cited by
- 273
- References
- 23
- FWCI
- 31.03
- Type
- journal article
- Language
- en
- Open access
- bronze
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.