Beyond contention: extending texture-based scheduling heuristics

  • Authors:

  • J. Christopher Beck;Andrew J. Davenport;Edward M. Sitarski;Mark S. Fox

  • Affiliations:

  • Department of Computer Science, University of Toronto, Toronto, Ontario, Canada;Department of Industrial Engineering, University of Toronto, Toronto, Ontario, Canada;Numetrix Limited, Toronto, Ontario, Canada;Department of Computer Science and Department of Industrial Engineering, University of Toronto, Toronto, Ontario, Canada

  • Venue:
  • AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to apply texture measurement based heuristic commitment techniques beyond the unary capacity resource constraints of job shop scheduling, we extend the contention texture measurement to a measure of the probability that a constraint will be broken. We define three methods for the estimation of this probability and show that they perform as well or better than existing heuristics on job shop scheduling problems. Empirical insight into the performance is provided and we sketch how we have extended probability-based heuristics to more complicated scheduling constraints.