A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- 1 April 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 90 (2) , 269-284
- https://doi.org/10.1016/0377-2217(95)00354-1
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systemsIntelligent Systems Engineering, 1994
- A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research, 1990
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Consistency in networks of relationsArtificial Intelligence, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974