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

The DOI matches its Crossref record.

Heuristics in Job Shop Scheduling

Gere, William S.·1966·Management Science

Abstract

The problem is that of scheduling jobs with diverse routings on the productive facilities in a shop such that the respective due dates are met, or failing this, the sum of lateness times is minimized. The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority rules for determining sequences of jobs on the machines, a number of heuristics or rules of thumb are incorporated. Both the static and dynamic problems are investigated. The efficacy of a small number of heuristics in combination with certain priority rules is demonstrated.

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.1287/mnsc.13.3.167

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 224

Metadata

Authors
Gere, W. S.
Venue
Management Science
Published
1966-11
Volume
13
Issue
3
Pages
167-190
ISSN
  • 0025-1909 (ISSN-L)
  • 1526-5501
OpenAlex
W2145557330
Cited by
224
References
0
FWCI
87.00
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 in Job Shop Scheduling. https://app.cochat.ai/papers/10.1287/mnsc.13.3.167
The paper
Gere, W. S. (1966). Heuristics in Job Shop Scheduling. Management Science. https://doi.org/10.1287/mnsc.13.3.167

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.