An Experimental Comparison of Constraint-Based Algorithms for the Preemptive Job-Shop Scheduling Problem

In the recent years, constraint programming has been applied to a wide variety of academic and industrial non-preemptive scheduling problems, i.e., problems in which activities cannot be interrupted. In comparis on, preemptive scheduling problems have received almost no attention from both the Operations Research and the Artificial Intelligence community (see, for example, (Demeulemeester, 1992) as one of a few exceptions). Motivated by the needs of a specific application, we engaged in a study of the applicability of const raint programming techniques to preemptive scheduling problems. This paper presents the algorithms we developed and the results we obtained on the preemptive variant of the famous “job-shop scheduling problem.” Eight heuristic search stra tegies, combined with two different constraint propagation techniques, are presented and compared using the preemptiv variant of job-shop scheduling instances from the literature. The best combination, which relies on “limited dis crepancy search” and on “edge-finding” techniques, is shown to provide excellent solutions to the preemptive job-shop scheduli ng problem. In particular, an optimal solution is derived for the preemptive variant of “FT10” in less than two minutes of CPU time. A mean relative distance to the optimal solution of 0.32% is achieved in five minutes, on a series of hard instances with 10 jobs and 10 machines (100 activities).