Texture-Based Heuristics for Scheduling Revisited

Recent scheduling work has challenged the need for sophisticated heuristics such as those based on texture measurements. This paper examines these claims in the light of advances in scheduling technology. We compare a number of current heuristic commitment techniques against a texture-based heuristic. Our results demonstrate that texture-based heuristics can outperform these widely-used heuristic commitment techniques.

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

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

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

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

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

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

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

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

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

[10]  Norman M. Sadeh,et al.  Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem , 1995, Artif. Intell..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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