The DOI matches its Crossref record.
Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
Abstract
We present a family of rolling horizon heuristics to minimize maximum lateness on a single machine in the presence of sequence-dependent setup times. This problem occurs as a subproblem in a decomposition procedure for more complicated job shop scheduling problems. The procedures solve a sequence of subproblems to optimality with a branch and bound algorithm and implements only part of the solution obtained. The size and number of the subproblems are controlled by algorithm parameters. Extensive computational experiments show that these procedures outperform myopic dispatching rules by an order of magnitude, both on average and in the worst case, in very reasonable computation times.
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
Cited by
A review of planning and scheduling systems and methods for integrated steel production
Tang, L., Liu, J., Rong, A., & Yang, Z. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00240-x · Cited by 362
Daily imaging scheduling of an earth observation satellite
Lin, W.-C., Liao, D.-Y., Liu, C.-Y., & Lee, Y.-Y. (2005) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2005.843380 · Cited by 173
Metadata
- Authors
- OVACIKT, I. M., & UZSOY, R.
- Venue
- International Journal of Production Research
- Publisher
- Informa UK Limited
- Published
- 1994-06
- Volume
- 32
- Issue
- 6
- Pages
- 1243-1263
- ISSN
- 0020-7543 (ISSN-L)
- 1366-588X
- OpenAlex
- W2048970339
- Cited by
- 164
- References
- 0
- FWCI
- 16.94
- 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: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. https://app.cochat.ai/papers/10.1080/00207549408956998
- The paper
- OVACIKT, I. M., & UZSOY, R. (1994). Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research. https://doi.org/10.1080/00207549408956998
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.