The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A branch and bound algorithm for the job-shop scheduling problem
Open accessOverview
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
Complexity of Machine Scheduling Problems
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70743-x · Cited by 2,197
Self-citationThe Shifting Bottleneck Procedure for Job Shop Scheduling
Adams, J., Balas, E., & Zawack, D. J. (1988) · Management Science · doi:10.1287/mnsc.34.3.391 · Cited by 1,603
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
A Computational Study of the Job-Shop Scheduling Problem
Applegate, D., & Cook, W. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.2.149 · Cited by 908
An Algorithm for Solving the Job-Shop Problem
Carlier, J., & Pinson, É. (1989) · Management Science · doi:10.1287/mnsc.35.2.164 · Cited by 824
The one-machine sequencing problem
Carlier, J. (1982) · European Journal of Operational Research · doi:10.1016/s0377-2217(82)80007-6 · Cited by 528
A practical use of Jackson's preemptive schedule for solving the job shop problem
Carlier, J., & Pinson, É. (1990) · Annals of Operations Research · doi:10.1007/bf03543071 · Cited by 188
A block approach for single-machine scheduling with release dates and due dates
Grabowski, J., Nowicki, E., & Zdrzałka, S. (1986) · European Journal of Operational Research · doi:10.1016/0377-2217(86)90191-8 · Cited by 148
Cited by
Resource-constrained project scheduling: Notation, classification, models, and methods
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00204-5 · Cited by 1,500
Self-citationDeterministic 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
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
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
LAVEA: latency-aware video analytics on edge computing platform
Yi, S., Hao, Z., Zhang, Q., Zhang, Q., Shi, W., & Li, Q. (2017) · Proceedings of the Second ACM/IEEE Symposium on Edge Computing · doi:10.1145/3132211.3134459 · Cited by 244
Metadata
- Authors
- Brucker, P., Jurisch, B., & Sievers, B.
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1994-03
- Volume
- 49
- Issue
- 1-3
- Pages
- 107-127
- ISSN
- 0166-218X (ISSN-L)
- OpenAlex
- W2041252124
- Cited by
- 499
- References
- 8
- FWCI
- 46.20
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A branch and bound algorithm for the job-shop scheduling problem. https://app.cochat.ai/papers/10.1016/0166-218x(94)90204-6
- The paper
- Brucker, P., Jurisch, B., & Sievers, B. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics. https://doi.org/10.1016/0166-218x(94)90204-6
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.