The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the Job-Shop Scheduling Problem
Abstract
This is a proposal for the application of discrete linear programming to the typical job-shop scheduling problem—one that involves both sequencing restrictions and also noninterference constraints for individual pieces of equipment. Thus far, no attempt has been made to establish the computational feasibility of the approach in the case of large-scale realistic problems. This formulation seems, however, to involve considerably fewer variables than two other recent proposals [Bowman, E. H. 1959. The schedule-sequencing problem. Opns Res. 7 621–624; Wagner, H. 1959. An integer linear-programming model for machine scheduling. Naval Res. Log. Quart. (June).], and on these grounds may be worth some computer experimentation.
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
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
The Schedule-Sequencing Problem
Bowman, E. H. (1959) · Operations Research · doi:10.1287/opre.7.5.621 · Cited by 292
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
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
Review of job shop scheduling research and its new perspectives under Industry 4.0
Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1350-2 · Cited by 558
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
Park, J., Chun, J., Kim, S. H., Kim, Y., & Park, J. (2021) · International Journal of Production Research · doi:10.1080/00207543.2020.1870013 · Cited by 329
Metadata
- Authors
- Manne, A. S.
- Venue
- Operations Research
- Published
- 1960-04
- Volume
- 8
- Issue
- 2
- Pages
- 219-223
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2166928920
- Cited by
- 666
- References
- 2
- FWCI
- 23.26
- 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.