A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
Open accessThe DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Leung, J., Kelly, L., & Anderson, J. H. (2004) · Cited by 1,411
An Algorithm for Solving the Job-Shop Problem
Carlier, J., & Pinson, É. (1989) · Management Science · doi:10.1287/mnsc.35.2.164 · Cited by 922
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
Pritsker, A. A. B., Waiters, L. J., & Wolfe, P. M. (1969) · Management Science · doi:10.1287/mnsc.16.1.93 · Cited by 772
Baptiste, P., Pape, C. L., & Nuijten, W. (2001) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4615-1479-4 · Cited by 738
An Applications Oriented Guide to Lagrangian Relaxation
Fisher, M. L. (1985) · Interfaces · doi:10.1287/inte.15.2.10 · Cited by 641
State‐space relaxation procedures for the computation of bounds to routing problems
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Networks · doi:10.1002/net.3230110207 · Cited by 426
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 309
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.1.52.7712 · Cited by 306
Adjustment of heads and tails for the job-shop problem
Carlier, J., & Pinson, É. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90379-4 · Cited by 290
Cited by
Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation
Cho, D.-H., Kim, J.-H., Choi, H.-L., & Ahn, J. (2018) · Journal of Aerospace Information Systems · doi:10.2514/1.i010620 · Cited by 98
Tanaka, S., & Araki, M. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.07.004 · Cited by 66
Self-citationOn the mass COVID-19 vaccination scheduling problem
Zhang, C., Li, Y., Cao, J., & Wen, X. (2022) · Computers & Operations Research · doi:10.1016/j.cor.2022.105704 · Cited by 58
Silva, Y. L. T. V., Subramanian, A., & Pessoa, A. A. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.09.006 · Cited by 58
Dynamic Programming algorithms and their applications in machine scheduling: A review
de Souza, E. A. G., Nagano, M. S., & Rolim, G. A. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.116180 · Cited by 55
Metadata
- Authors
- Tanaka, S., & Fujikuma, S.
- Affiliations
- Kyoto University (JP)
- Corresponding author
- Tanaka, Shunji
- ORCID
- Tanaka, Shunji
- Venue
- Journal of Scheduling
- Published
- 2011-06-23
- Volume
- 15
- Issue
- 3
- Pages
- 347-361
- ISSN
- 1094-6136 (ISSN-L)
- 1099-1425
- OpenAlex
- W2023149476
- Cited by
- 52
- References
- 50
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 3 · 2023: 4 · 2022: 7 · 2021: 4 · 2020: 6 · 2019: 2 · 2018: 3 · 2017: 2 · 2016: 6 · 2015: 2 · 2014: 3 · 2013: 4 · 2012: 1
- FWCI
- 9.01
- Type
- journal article
- Language
- en
- Open access
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Scheduling (publishedVersion)
- Institutional Repositories DataBase (IRDB) (submittedVersion)
- Kyoto University Research Information Repository (Kyoto University) (submittedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Social Sciences › Decision Sciences › Management Science and Operations Research › Resource-Constrained Project Scheduling
- Social Sciences › Decision Sciences › Management Science and Operations Research › Healthcare Operations and Scheduling Optimization
- Keywords
- single machine scheduling, machine idle time, exact algorithms, dynamic programming, total weighted completion time, total weighted tardiness
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: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. https://app.cochat.ai/papers/10.1007/s10951-011-0242-0
- The paper
- Tanaka, S., & Fujikuma, S. (2012). A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. Journal of Scheduling. https://doi.org/10.1007/s10951-011-0242-0
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.