The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Scheduling and rescheduling with iterative repair
Open accessAbstract
The GERRY scheduling and rescheduling system being applied to coordinate Space Shuttle ground processing is described. The system uses constraint-based iterative repair, a technique that starts with a complete but possibly flawed schedule and iteratively improves it by using constraint knowledge within repair heuristics. The tradeoff between the informedness and the computational cost of several repair heuristics is explored. It is shown empirically that some knowledge can greatly improve the convergence speed of a repair-based system, but that too much knowledge can overwhelm a system and result in degraded performance.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
The psychology of computer vision
Rosenfeld, A. (1976) · Artificial Intelligence · doi:10.1016/0004-3702(76)90008-4 · Cited by 2,966
Consistency in networks of relations
Mackworth, A. K. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90007-8 · Cited by 2,498
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Planning for conjunctive goals
Chapman, D. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90092-0 · Cited by 1,112
Learning and executing generalized robot plans
Fikes, R. E., Hart, P. E., & Nilsson, N. J. (1972) · Artificial Intelligence · doi:10.1016/0004-3702(72)90051-3 · Cited by 1,019
Understanding Line drawings of Scenes with Shadows
Waltz, D. L. (1975) · Cited by 917
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
A Sufficient Condition for Backtrack-Free Search
Freuder, E. C. (1982) · Journal of the ACM · doi:10.1145/322290.322292 · Cited by 660
ISIS—a knowledge‐based system for factory scheduling
Fox, M. S., & Smith, S. F. (1984) · Expert Systems · doi:10.1111/j.1468-0394.1984.tb00424.x · Cited by 551
Constraint propagation with interval labels
Davis, E. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90091-9 · Cited by 531
Self-citationConstraint-directed search : a case study of job-shop scheduling
Fox, M. S. (2018) · doi:10.1184/r1/6552371 · Cited by 526
O-Plan: The open planning architecture
Currie, K., & Tate, A. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90024-e · Cited by 407
CHEF: a model of case-based planning
Hammond, K. J. (1986) · Cited by 347
A Computational Model of Skill Acquisition
Sussman, G. J. (1973) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 339
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
Minton, S., Johnston, M., Philips, A. B., & Laird, P. D. (1990) · National Conference on Artificial Intelligence · Cited by 278
A validation-structure-based theory of plan modification and reuse
Subbarao Kambhampati, B., & Hendler, J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90056-4 · Cited by 236
Learning effective search control knowledge: an explanation-based approach
Minton, S., & Carbonell, J. (1988) · Cited by 194
Anytime synthetic projection: maximizing the probability of goal satisfaction
Drummond, M., & Bresina, J. L. (1990) · National Conference on Artificial Intelligence · Cited by 148
Learning Search Control Knowledge
Minton, S. (1988) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1703-6 · Cited by 118
Subbarao Kambhampati, B. (1990) · Cited by 48
Learning to improve constraint-based scheduling
Zweben, M., Davis, E. D., Daun, B., Drascher, E., Deale, M., & Eskey, M. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90010-u · Cited by 27
Self-citation
Cited by
AFSCN scheduling: How the problem and solution have evolved
Barbulescu, L., Howe, A., & Whitley, D. (2006) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2005.12.004 · Cited by 69
Machine Learning for Cognitive Networks: Technology Assessment and Research Challenges
Dietterich, T. G., & Langley, P. (2007) · Cognitive Networks · doi:10.1002/9780470515143.ch5 · Cited by 39
Metadata
- Authors
- Zweben, M., Davis, E., Daun, B., & Deale, M. J.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1993
- Volume
- 23
- Issue
- 6
- Pages
- 1588-1596
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2160107283
- Cited by
- 275
- References
- 23
- FWCI
- 10.10
- Type
- journal article
- Language
- en
- Open access
- green
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.