The DOI matches its Crossref record.
Optimal two‐ and three‐stage production schedules with setup times included
Abstract
Each of a collection of items are to be produced on two machines (or stages). Each machine can handle only one item at a time and each item must be processed through machine one and then through machine two. The setup time plus work time for each item for each machine is known. A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum. A three‐machine problem is also discussed and solved for a restricted case.
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 multi-objective genetic local search algorithm and its application to flowshop scheduling
Ishibuchi, H., & Murata, T. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.704576 · Cited by 1,019
Flowshop-scheduling problems with makespan criterion: a review
Reza Hejazi *, S., & Saghafian, S. (2005) · International Journal of Production Research · doi:10.1080/0020754050056417 · Cited by 342
LAVEA: latency-aware video analytics on edge computing platform
Yi, S., Hao, Z., Zhang, Q., Zhang, Q., Shi, W., & Li, Q. (2017) · Proceedings of the Second ACM/IEEE Symposium on Edge Computing · doi:10.1145/3132211.3134459 · Cited by 244
Xiao, Y., Zhang, S., Yang, P., You, M., & Huang, J. (2019) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2019.03.016 · Cited by 46
Metadata
- Authors
- Johnson, S. M.
- Venue
- Naval Research Logistics Quarterly
- Publisher
- Wiley
- Published
- 1954-03
- Volume
- 1
- Issue
- 1
- Pages
- 61-68
- ISSN
- 0028-1441 (ISSN-L)
- 1931-9193
- OpenAlex
- W2024085737
- Cited by
- 3,252
- References
- 0
- FWCI
- 91.75
- 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: Optimal two‐ and three‐stage production schedules with setup times included. https://app.cochat.ai/papers/10.1002/nav.3800010110
- The paper
- Johnson, S. M. (1954). Optimal two‐ and three‐stage production schedules with setup times included. Naval Research Logistics Quarterly. https://doi.org/10.1002/nav.3800010110
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.
