Improved CLP Scheduling with Task Intervals
Pascal Van Hentenryck · 1994
In this paper we present a new technique that can be used to improve performance of job scheduling with a constraint programming language. We show how, by focusing on some special sets of tasks, one can bring eLP in the same range of efficiency as traditional OR algorithms on a classical benchmark(MT10 [MT63]), thus makingCLP both a flexible and an efficient technique for such combinatorial problems. We then present our programming methodology which we have successfully used on many problems, and draw conclusions on what features constraint programming languages should offer to allow its use.