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. tics with the same consistency techniques (Nuijten, 1994). In this paper we re-evaluate texture-based heuristics in light of recent advances in scheduling technology and show that on two job shop scheduling problem sets (a widely used set of Operations Research benchmark problems and a set of randomly generated, hard problems) a texture-based heuristic outperforms heuristic commitment techniques found in the literature.

Authors

• J. Christopher Beck University of Toronto
• Edward M. Sitarski Mark S. Fox

Keywords

No keywords are indexed for this paper.