Constraint-Based Scheduling
Beyond NP: Arc-Consistency for Quantified Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A New Multi-resource cumulatives Constraint with Negative Heights
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Practical Bilevel Optimization: Algorithms and Applications (Nonconvex Optimization and Its Applications)
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
QCSP made practical by virtue of restricted quantification
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A general framework for scheduling in a stochastic environment
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Views and iterators for generic constraint implementations
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Quantified Constraint Optimization
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
We consider cumulative scheduling problems in the presence of an adversary. In such setting the scheduler tries to manage the available resources in so as to meet the scheduling deadline, while the adversary is allowed to change some parameters---like the resource consumption of some tasks---up to a certain limit. We ask whether a robust schedule exists, i.e., one that is guaranteed to work whatever (malicious) actions the opponent may take. We propose to model this family of decision problems using a variant of Quantified Constraint Satisfaction Problems called QCSP+, and to solve them by using the solver QeCode.