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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

87 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
Pagina's (van-tot)269-284
Aantal pagina's16
TijdschriftEuropean Journal of Operational Research
Volume90
Nummer van het tijdschrift2
DOI's
StatusGepubliceerd - 1996

Vingerafdruk Duik in de onderzoeksthema's van 'A computational study of constraint satisfaction for multiple capacitated job shop scheduling'. Samen vormen ze een unieke vingerafdruk.

Citeer dit