703 search results - page 38 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
IPCO
1998
14 years 11 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
CEC
2005
IEEE
14 years 11 months ago
2005
IEEE
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
AIPS
2008
14 years 12 months ago
2008
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
106
click to vote
CONSTRAINTS
2011
14 years 4 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...