The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
Abstract
This paper introduces a new neighborhood search technique, called dynasearch, that uses dynamic programming to search an exponential size neighborhood in polynomial time. While traditional local search algorithms make a single move at each iteration, dynasearch allows a series of moves to be performed. The aim is for the lookahead capabilities of dynasearch to prevent the search from being attracted to poor local optima. We evaluate dynasearch by applying it to the problem of scheduling jobs on a single machine to minimize the total weighted tardiness of the jobs. Dynasearch is more effective than traditional first-improve or best-improve descent in our computational tests. Furthermore, this superiority is much greater for starting solutions close to previous local minima. Computational results also show that an iterated dynasearch algorithm in which descents are performed a few random moves away from previous local minima is superior to other known local search procedures for the total weighted tardiness 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
Complexity of Machine Scheduling Problems
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70743-x · Cited by 2,197
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
OR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1057/jors.1990.166 · Cited by 1,899
Local Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 808
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness
Lawler, E. L. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70742-8 · Cited by 610
Heuristic scheduling systems with applications to production systems and project management
(1995) · European Journal of Operational Research · doi:10.1016/0377-2217(95)90067-5 · Cited by 356
Large-step Markov chains for the Traveling Salesman Problem
Martin, O. (2018) · doi:10.6083/nk322d67m · Cited by 321
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
Potts, C. N., & Wassenhove, L. N. V. (1985) · Operations Research · doi:10.1287/opre.33.2.363 · Cited by 278
Self-citationCombining simulated annealing with local search heuristics
Martin, O. C., & Otto, S. W. (1996) · Annals of Operations Research · doi:10.1007/bf02601639 · Cited by 216
Cited by
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Iterated Local Search: Framework and Applications
Lourenço, H. R., Martin, O. C., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_12 · Cited by 571
Tanaka, S., & Fujikuma, S. (2012) · Journal of Scheduling · doi:10.1007/s10951-011-0242-0 · Cited by 52
A hybrid approach for optimizing carbon footprint in intercloud environment
Justafort, V. D., Beaubrun, R., & Pierre, S. (2019) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2638900 · Cited by 7
Metadata
- Authors
- Congram, R. K., Potts, C. N., & van de Velde, S. L.
- Venue
- INFORMS Journal on Computing
- Published
- 2002-02
- Volume
- 14
- Issue
- 1
- Pages
- 52-67
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2164483807
- Cited by
- 306
- References
- 15
- FWCI
- 79.90
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. https://app.cochat.ai/papers/10.1287/ijoc.14.1.52.7712
- The paper
- Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002). An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.14.1.52.7712
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.