Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 547

The DOI matches its Crossref record.

Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum

Palmer, D. S.·1965·Journal of the Operational Research Society

Abstract

In the situation where a number of items must pass through a number of processes in the same order, it is suggested that the optimum (minimum total time) scheduling may be approximated by giving priority to items according to the extent to which process time increases with process number in order; this criterion is put in arithmetical form. This is confirmed by (a) a simple geometrical argument; (b) comparison with the known optimum schedules of a number of published three-process cases; (c) experiments on larger cases; it is not practical here to find the exact optimum.Methods are given for obtaining lower bounds which all scheduling times must equal or exceed; besides placing limits on the amount of effort to be expended, these bounds support the suggested approximate method.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1057/jors.1965.8

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 547

Metadata

Authors
Palmer, D. S.
Venue
Journal of the Operational Research Society
Published
1965-03
Volume
16
Issue
1
Pages
101-107
ISSN
  • 0160-5682 (ISSN-L)
  • 1476-9360
OpenAlex
W2092732888
Cited by
547
References
0
FWCI
48.50
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: Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum. https://app.cochat.ai/papers/10.1057/jors.1965.8
The paper
Palmer, D. S. (1965). Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum. Journal of the Operational Research Society. https://doi.org/10.1057/jors.1965.8

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.