The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Abstract
In this paper search heuristics are developed for generic sequencing problems with emphasis on job shop scheduling. The proposed methods integrate problem specific heuristics common to Operations Research and local search approaches from Artificial Intelligence in order to obtain desirable properties from both. The applicability of local search to a wide range of problems, and the incorporation of problem-specific information are both properties of the proposed algorithms. Two methods are proposed, both of which are based on novel definitions of solution spaces and of neighborhoods in these spaces. Applications of the proposed methodology are developed for job shop scheduling problems, and can be easily applied with any scheduling objective. To demonstrate effectiveness, the method is tested on the job shop scheduling problem with the minimum makespan objective. Encouraging results are obtained.
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
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Cited by
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Kwok, Y.-K., & Ahmad, I. (1999) · ACM Computing Surveys · doi:10.1145/344588.344618 · Cited by 1,314
Cheng, R., Gen, M., & Tsujimura, Y. (1999) · Computers & Industrial Engineering · doi:10.1016/s0360-8352(99)00022-4 · Cited by 323
Cheng, R., Gen, M., & Tsujimura, Y. (1999) · Computers & Industrial Engineering · doi:10.1016/s0360-8352(99)00136-9 · Cited by 303
A new dominance rule to minimize total weighted tardiness with unequal release dates
Akturk, M. S., & Ozdemir, D. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00319-2 · Cited by 54
Metadata
- Authors
- Storer, R. H., Wu, S. D., & Vaccari, R.
- Venue
- Management Science
- Published
- 1992-10
- Volume
- 38
- Issue
- 10
- Pages
- 1495-1509
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2145079270
- Cited by
- 546
- References
- 1
- FWCI
- 35.61
- 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: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. https://app.cochat.ai/papers/10.1287/mnsc.38.10.1495
- The paper
- Storer, R. H., Wu, S. D., & Vaccari, R. (1992). New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Management Science. https://doi.org/10.1287/mnsc.38.10.1495
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.