The DOI matches its Crossref record.
Heuristics in Job Shop Scheduling
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.
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
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Panwalkar, S. S., & Iskander, W. (1977) · Operations Research · doi:10.1287/opre.25.1.45 · Cited by 1,294
A state-of-the-art survey of dispatching rules for manufacturing job shop operations
BLACKSTONE, J. H., PHILLIPS, D. T., & HOGG, G. L. (1982) · International Journal of Production Research · doi:10.1080/00207548208947745 · Cited by 1,013
Deterministic job-shop scheduling: Past, present and future
Jain, A. S., & Meeran, S. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00113-1 · Cited by 782
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
Pritsker, A. A. B., Waiters, L. J., & Wolfe, P. M. (1969) · Management Science · doi:10.1287/mnsc.16.1.93 · Cited by 772
Chapter 9 Sequencing and scheduling: Algorithms and complexity
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80189-6 · Cited by 761
The job shop scheduling problem: Conventional and new solution techniques
Błażewicz, J., Domschke, W., & Pesch, E. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00362-2 · Cited by 536
Fallstudie zur Fertigungssteuerung mit Prioritätsregeln
Witte, T. (1992) · Fertigungssteuerung · doi:10.1007/978-3-322-89141-9_13 · Cited by 3
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
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.