703 search results - page 13 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
AAAI
2008
13 years 9 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
COR
2010
13 years 7 months ago
2010
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
AMC
2008
13 years 7 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
CSCLP
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...