Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints

Authors:
Philippe Baptiste;Claude Le Pape;Laurent Péridy
Affiliations:
-;-;-
Venue:
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Year:
1998

Citing 8
Cited 3

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
A practical use of Jackson's preemptive schedule for solving the job shop problem

Annals of Operations Research
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Scheduling Algorithms

Scheduling Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Constraint solving over semirings

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Constraint (Logic) Programming: A Survey on Research and Applications

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
New dominance rules and exploration strategies for the 1|ri|ΣUi scheduling problem

Computational Optimization and Applications
Scheduling a single machine to minimize a regular objective function under setup constraints

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the results of a case study, concerning the propagation of a global disjunctive resource constraint, when the resource is over-loaded. The problem can be seen as a partial constraint satisfaction problem, in which either the resource constraint or the due dates of some jobs have to be violated. Global constraint propagation methods are introduced to efficiently deal with this situation. These methods are applied to a well-known operations research problem: minimizing the number of late jobs on a single machine, when jobs are subjected to release dates and due dates. Dominance criteria and a branch and bound procedure are developed for this problem. 960 instances are generated with respect to different characteristics (number of jobs, overload ratio, distribution of release dates, of due dates and of processing times). Instances with 60 jobs are solved in 23 seconds on average and 90% of the instances with 100 jobs are solved in less than 1 hour.