Scheduling and rescheduling with iterative repair

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. >

[1]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[2]  Gerald J. Sussman,et al.  A Computational Model of Skill Acquisition , 1973 .

[3]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[5]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[6]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  David E. Wilkins,et al.  Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..

[9]  Stephen F. Smith,et al.  ISIS—a knowledge‐based system for factory scheduling , 1984 .

[10]  David P. Miller,et al.  Deadlines, Travel Time, and Robot Problem Solving , 1985, IJCAI.

[11]  Kristian J. Hammond,et al.  CHEF: A Model of Case-Based Planning , 1986, AAAI.

[12]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[13]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[14]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[15]  Jaime G. Carbonell,et al.  Learning effective search control knowledge: an explanation-based approach , 1988 .

[16]  Stephen F. Smith,et al.  Reactive Plan Revision , 1988, AAAI.

[17]  Reid Simmons,et al.  Combining Associational and Causal Reasoning to Solve Interpretation and Planning Problems , 1988 .

[18]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[19]  David L. Akin,et al.  The MFIVE Space Station Crew Activity Scheduler and Stowage Logistics Clerk , 1989 .

[20]  Monte Zweben,et al.  Constraint Satisfaction with Delayed Evaluation , 1989, IJCAI.

[21]  N. Sadeh,et al.  Preference Propagation in Temporal/Capacity Constraint Graphs , 1989 .

[22]  John L. Bresina,et al.  Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction , 1990, AAAI.

[23]  Subbarao Kambhampati,et al.  A Theory of Plan Modification , 1990, AAAI.

[24]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[25]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[26]  Eric Biefeld,et al.  Bottleneck Identification Using Process Chronologies , 1991, IJCAI.

[27]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[28]  Monte Zweben,et al.  Learning to Improve Constraint-Based Scheduling , 1992, Artif. Intell..

[29]  Monte Zweben,et al.  Rescheduling with iterative repair , 1992 .

[30]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..