The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Heuristics for flow-shop scheduling
Abstract
Existing methods are reviewed and new heuristics examined and developed for the flow-shop scheduling problem. Comparative tests are carried out using simulation methods on different sizes of problem and with different variability of processing time data. New heuristic scheduling rules are determined which give high performance for flow-shop scheduling where there is (i) no job-passing and (ii) no job-waiting.
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
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Cited by
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Hall, N. G., & Sriskandarajah, C. (1996) · Operations Research · doi:10.1287/opre.44.3.510 · Cited by 842
A comprehensive review and evaluation of permutation flowshop heuristics
Ruiz, R., & Maroto, C. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.04.017 · Cited by 579
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Pan, Q.-K., Fatih Tasgetiren, M., & Liang, Y.-C. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2006.12.030 · Cited by 445
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
Metadata
- Authors
- KING, J. R., & SPACHIS, A. S.
- Venue
- International Journal of Production Research
- Publisher
- Informa UK Limited
- Published
- 1980-05
- Volume
- 18
- Issue
- 3
- Pages
- 345-357
- ISSN
- 0020-7543 (ISSN-L)
- 1366-588X
- OpenAlex
- W2051788118
- Cited by
- 197
- References
- 1
- FWCI
- 6.45
- 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: Heuristics for flow-shop scheduling. https://app.cochat.ai/papers/10.1080/00207548008919673
- The paper
- KING, J. R., & SPACHIS, A. S. (1980). Heuristics for flow-shop scheduling. International Journal of Production Research. https://doi.org/10.1080/00207548008919673
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.