A computational study of constraint satisfaction for multiple capacitated job shop scheduling

A computational study of constraint satisfaction for multiple capacitated job shop scheduling

0.00 Avg rating0 Votes
Article ID: iaor1999155
Country: Netherlands
Volume: 90
Issue: 2
Start Page Number: 269
End Page Number: 284
Publication Date: Apr 1996
Journal: European Journal of Operational Research
Authors: ,
Keywords: job shop, constraint handling languages
Abstract:

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 algorithm based on constraint satisfaction techniques to handle the problem effectively. 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.

Reviews

Required fields are marked *. Your email address will not be published.