The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Ant colony optimization combined with taboo search for the job shop 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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Dorigo, M., & Stützle, T. (2004) · The MIT Press eBooks · doi:10.7551/mitpress/1290.001.0001 · Cited by 3,330
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
The Shifting Bottleneck Procedure for Job Shop Scheduling
Adams, J., Balas, E., & Zawack, D. J. (1988) · Management Science · doi:10.1287/mnsc.34.3.391 · Cited by 1,603
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
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
A Computational Study of the Job-Shop Scheduling Problem
Applegate, D., & Cook, W. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.2.149 · Cited by 908
An Algorithm for Solving the Job-Shop Problem
Carlier, J., & Pinson, É. (1989) · Management Science · doi:10.1287/mnsc.35.2.164 · Cited by 824
Deterministic job-shop scheduling: Past, present and future
Jain, A. S., & Meeran, S. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00113-1 · Cited by 782
Proceedings of the 2000 Congress on Evolutionary Computation
(2000) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870267 · Cited by 766
Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules
Fisher, H. F. (1963) · Medical Entomology and Zoology · Cited by 729
Ant system for Job-shop Scheduling
Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 617
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
An improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
The job shop scheduling problem: Conventional and new solution techniques
Błażewicz, J., Domschke, W., & Pesch, E. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00362-2 · Cited by 536
Blum, C. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.018 · Cited by 421
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Balas, E., & Vazacopoulos, A. (1998) · Management Science · doi:10.1287/mnsc.44.2.262 · Cited by 407
An effective hybrid optimization strategy for job-shop scheduling problems
Wang, L., & Zheng, D.-Z. (2001) · Computers & Operations Research · doi:10.1016/s0305-0548(99)00137-9 · Cited by 277
Job shop scheduling by local search
Aarts, E. E., Lenstra, J. J. K., Laarhoven, P. P. V., & Ulder, N. N. (1992) · TU/e Research Portal · Cited by 232
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
Parallel GRASP with path-relinking for job shop scheduling
Aiex, R. M., Binato, S., & Resende, M. G. C. (2003) · Parallel Computing · doi:10.1016/s0167-8191(03)00014-0 · Cited by 218
A tabu search method guided by shifting bottleneck for the job shop scheduling problem
Pezzella, F., & Merelli, E. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00158-7 · Cited by 211
An Ant Approach to the Flow Shop Problem
Stützle, T. (1998) · Cited by 183
A Grasp for Job Shop Scheduling
Binato, S., Hery, W. J., Loewenstern, D., & Resende, M. G. C. (2002) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-1507-4_3 · Cited by 169
Fleurent, C., & Glover, F. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.198 · Cited by 163
An ant colony optimization approach for the single machine total tardiness problem
Bauer, A., Bullnheimer, B., Hartl, R. F., & Strauß, C. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.782653 · Cited by 129
ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification
Blum, C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45724-0_2 · Cited by 57
Cited by
Review of job shop scheduling research and its new perspectives under Industry 4.0
Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1350-2 · Cited by 558
Actor-Critic Deep Reinforcement Learning for Solving Job Shop Scheduling Problems
Liu, C.-L., Chang, C.-C., & Tseng, C.-J. (2020) · IEEE Access · doi:10.1109/access.2020.2987820 · Cited by 281
Metadata
- Authors
- Huang, K.-L., & Liao, C.-J.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2008-04
- Volume
- 35
- Issue
- 4
- Pages
- 1030-1046
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2011649121
- Cited by
- 278
- References
- 31
- FWCI
- 42.75
- 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.
