The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Filtered beam search in scheduling†
Abstract
Beam search is a technique for searching decision trees, particularly where the solution space is vast. The technique involves systematically developing a small number of solutions in parallel so as to attempt to maximize the probability of finding a good solution with minimal search effort. In this paper, we systematically study the performance behaviour of beam search with other heuristic methods for scheduling, and the effects of using different evaluation functions to guide the search. We also develop a new variation of beam search, called filtered beam search which is computationally simple yet produces high quality solutions.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
Constraint-directed search : a case study of job-shop scheduling
Fox, M. S. (2018) · doi:10.1184/r1/6552371 · Cited by 526
The HARPY speech recognition system
Lowerre, B. T. (1976) · Cited by 474
Gelperin, D. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90005-4 · Cited by 121
A world-championship-level Othello program
Rosenbloom, P. S. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90003-0 · Cited by 84
The ARGOS Image Understanding System,
Rubin, S. M. (1978) · Defense Technical Information Center (DTIC) · doi:10.21236/ada066736 · Cited by 72
Chess as problem solving: the development of a tactics analyzer.
Berliner, H. (1975) · Cited by 61
Cited by
Ant colony optimization: Introduction and recent trends
Blum, C. (2005) · Physics of Life Reviews · doi:10.1016/j.plrev.2005.10.001 · Cited by 1,308
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
Feature dimensionality reduction: a review
Jia, W., Sun, M., Lian, J., & Hou, S. (2022) · Complex & Intelligent Systems · doi:10.1007/s40747-021-00637-x · Cited by 797
Ant Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_8 · Cited by 579
Blum, C. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.018 · Cited by 421
Metadata
- Authors
- OW, P. S., & MORTON, T. E.
- Venue
- International Journal of Production Research
- Publisher
- Informa UK Limited
- Published
- 1988-01
- Volume
- 26
- Issue
- 1
- Pages
- 35-62
- ISSN
- 0020-7543 (ISSN-L)
- 1366-588X
- OpenAlex
- W2100233978
- Cited by
- 393
- References
- 9
- FWCI
- 10.88
- 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: Filtered beam search in scheduling†. https://app.cochat.ai/papers/10.1080/00207548808947840
- The paper
- OW, P. S., & MORTON, T. E. (1988). Filtered beam search in scheduling†. International Journal of Production Research. https://doi.org/10.1080/00207548808947840
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.