Optimal two- and three-stage production schedules with setup times included¶
Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61-68.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Scheduling
- The discipline has roots in operations research: Johnson's (1954) two-machine flow-shop optimization, establishing that the Johnson rule (sequence jobs to minimize makespan on two machines by sorting on minimum of {job's first-machine time, job's second-machine time}) is optimal; Graham's list scheduling and multiprocessor timing anomalies (1969), formalizing the α|β|γ notation for machine environments, job characteristics, and objectives; and the classic job-shop, flow-shop, and open-shop problems studied extensively since the 1950s.
This sourceClassic result showing that a specific sequencing rule minimizes makespan in the two-machine flow shop, formalizing the counterfactual logic that reordering tasks changes outcomes by a determinable amount.
- The discipline has roots in operations research: Johnson's (1954) two-machine flow-shop optimization, establishing that the Johnson rule (sequence jobs to minimize makespan on two machines by sorting on minimum of {job's first-machine time, job's second-machine time}) is optimal; Graham's list scheduling and multiprocessor timing anomalies (1969), formalizing the α|β|γ notation for machine environments, job characteristics, and objectives; and the classic job-shop, flow-shop, and open-shop problems studied extensively since the 1950s.
- Sequencing
- It encourages practitioners to think in terms of dependencies, bottlenecks, and trade-offs, a counterfactual reordering logic Johnson (1954) introduced when he proved that a specific two-machine flow-shop sequence minimizes makespan—showing that order, not task content, drives the result.
This sourceClassic result showing that a specific sequencing rule minimizes makespan in the two-machine flow shop, formalizing the counterfactual logic that reordering tasks changes outcomes by a determinable amount.
- It encourages practitioners to think in terms of dependencies, bottlenecks, and trade-offs, a counterfactual reordering logic Johnson (1954) introduced when he proved that a specific two-machine flow-shop sequence minimizes makespan—showing that order, not task content, drives the result.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:69e110b420ac · see in the full table