Sciweavers

ECAI
1994
Springer

Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling

13 years 9 months ago
Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations simultaneously. We present an algorithmbased on constraint satisfaction techniques to handle the problem e ectively. The most important novel feature of our algorithm is the consistency checking. An empirical performance analysis is performed using a well-known set of instances of the job shop scheduling problem and a newly constructed set of instances of the multiple capacitated job shop scheduling problem. We show that our algorithm performs well for both sets of instances.
W. P. M. Nuijten, Emile H. L. Aarts
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1994
Where ECAI
Authors W. P. M. Nuijten, Emile H. L. Aarts
Comments (0)