Constraint propagation techniques for the disjunctive scheduling problem
- 30 September 2000
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 122 (1-2), 189-240
- https://doi.org/10.1016/s0004-3702(00)00040-0
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Arc consistency revisitedInformation Processing Letters, 1999
- Using constraint metaknowledge to reduce arc consistency computationArtificial Intelligence, 1999
- The job shop scheduling problem: Conventional and new solution techniquesEuropean Journal of Operational Research, 1996
- The job-shop problem and immediate selectionAnnals of Operations Research, 1994
- A branch and bound algorithm for the job-shop scheduling problemDiscrete Applied Mathematics, 1994
- Arc-consistency and arc-consistency againArtificial Intelligence, 1994
- Reasoning about qualitative temporal informationArtificial Intelligence, 1992
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Constraint satisfaction from a deductive viewpointArtificial Intelligence, 1988
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982