CoChat

A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

Open access
Tanaka, Shunji, Fujikuma, Shuji · 2012 · Journal of Scheduling

The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1007/s10951-011-0242-0

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 50 references

Cited by

See all 61

Metadata

Authors
Tanaka, S., & Fujikuma, S.
Affiliations
Kyoto University (JP)
Corresponding author
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
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.