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

W.P.M. Nuijten, E.H.L. Aarts

Research output: Contribution to journalArticleScientificpeer-review

88 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)269-284
Number of pages16
JournalEuropean Journal of Operational Research
Volume90
Issue number2
DOIs
Publication statusPublished - 1996
Externally publishedYes

Fingerprint

Dive into the research topics of 'A computational study of constraint satisfaction for multiple capacitated job shop scheduling'. Together they form a unique fingerprint.

Cite this