Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics

Abstract While the exploitation of problem structure by heuristic search techniques has a long history in AI (Simon, 1973), many of the advances in constraint-directed scheduling technology in the 1990s have resulted from the creation of powerful propagation techniques. In this paper, we return to the hypothesis that understanding of problem structure plays a critical role in successful heuristic search even in the presence of powerful propagators. In particular, we examine three heuristic commitment techniques and show that the two techniques based on dynamic problem structure analysis achieve superior performance across all experiments. More interestingly, we demonstrate that the heuristic commitment technique that exploits dynamic resource-level non-uniformities achieves superior overall performance when those non-uniformities are present in the problem instances.

[1]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[2]  J. Christopher Beck,et al.  THE ODO PROJECT: TOWARD A UNIFIED BASIS FOR CONSTRAINT-DIRECTED SCHEDULING , 1998 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[5]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[6]  Stephen F. Smith.  Exploiting Temporal Knowledge to Organize Constraints , 1983 .

[7]  Nicola Muscettola,et al.  On the Utility of Bottleneck Reasoning for Scheduling , 1994, AAAI.

[8]  J. Christopher Beck,et al.  Five Pitfalls of Empirical Scheduling Research , 1997, CP.

[9]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[10]  Barbara M. Smith,et al.  Trying Harder to Fail First , 1998, ECAI.

[11]  Toby Walsh,et al.  The Hardest Random SAT Problems , 1994, KI.

[12]  Philippe Baptiste,et al.  Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling , 1995 .

[13]  Bernhard Nebel,et al.  KI-94: Advances in Artificial Intelligence , 1994, Lecture Notes in Computer Science.

[14]  J. C. Jackson.  Constrainedness and the Phase Transition in Job Shop Scheduling , 1997 .

[15]  S.J.J. Smith,et al.  Empirical Methods for Artificial Intelligence , 1995 .

[16]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[17]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[18]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[19]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[20]  Kees M. van Hee,et al.  Randomized constraint satisfaction for job shop scheduling , 1993, International Joint Conference on Artificial Intelligence.

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

[22]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[23]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[24]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

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

[26]  Philippe Baptiste,et al.  Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case , 1996, ECAI.

[27]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[28]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[29]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[30]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[31]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[32]  Toby Walsh,et al.  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem , 1996, CP.

[33]  Stephen F. Smith,et al.  OPIS: an opportunistic factory scheduling system , 1990, IEA/AIE '90.

[34]  Toby Walsh,et al.  Encodings of Non-Binary Constraint Satisfaction Problems , 1999, AAAI/IAAI.

[35]  A. ILOGS..  DISJUNCTIVE CONSTRAINTS FOR MANUFACTURING SCHEDULING : PRINCIPLES AND EXTENSIONS , 1995 .

[36]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[37]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[38]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[39]  Toby Walsh,et al.  The Constrainedness of Search , 1996, AAAI/IAAI, Vol. 1.

[40]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[41]  Nicola Muscettola,et al.  Scheduling by iterative partition of bottleneck conflicts , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

[42]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[43]  Norman Sadeh,et al.  Look-ahead techniques for micro-opportunistic job shop scheduling , 1992 .

[44]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[45]  W. D. Harvey,et al.  Nonsystematic backtracking search , 1995 .

[46]  François Laburthe,et al.  Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation , 1995, Combinatorics and Computer Science.

[47]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[48]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[49]  J. Christopher Beck,et al.  Beyond Contention: Extending Texture-Based Scheduling Heuristics , 1997, AAAI/IAAI.

[50]  J. Christopher Beck,et al.  Scheduling Alternative Activities , 1999, AAAI/IAAI.

[51]  Stephen F. Smith,et al.  An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows , 1999, IJCAI.

[52]  R. M. Oliver,et al.  Influence diagrams, belief nets and decision analysis , 1992 .

[53]  J. Christopher Beck,et al.  This Is a Publication of The American Association for Artificial Intelligence , 2022 .

[54]  Herbert A. Simon,et al.  The Structure of Ill Structured Problems , 1973, Artif. Intell..

[55]  Stephen F. Smith,et al.  Stochastic Procedures for Generating Feasible Schedules , 1997, AAAI/IAAI.

[56]  Wpm Wim Nuijten,et al.  Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .

[57]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[58]  Philippe Baptiste,et al.  Constraint-Based Optimization and Approximation for Job-Shop Scheduling , 1995 .

[59]  J. Erschler,et al.  Characterizing the set of feasible sequences for n jobs to be carried out on a single machine , 1980 .

[60]  J. Christopher Beck,et al.  Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling , 1999 .

[61]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

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

[63]  Norman M. Sadeh,et al.  Constrained Heuristic Search , 1989, IJCAI.

[64]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[65]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[66]  J. Erschler,et al.  Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem , 1976, Oper. Res..

[67]  P. Baptiste,et al.  Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling , 1996 .

[68]  Philippe Baptiste,et al.  An Experimental Comparison of Constraint-Based Algorithms for the Preemptive Job-Shop Scheduling Problem , 1997 .

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

[70]  J. Christopher Beck,et al.  Texture-Based Heuristics for Scheduling Revisited , 1997, AAAI/IAAI.

[71]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.