703 search results - page 60 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
153
click to vote
AIPS
2004
15 years 7 months ago
2004
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
165
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
176
click to vote
AI
2005
Springer
15 years 5 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
147
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
134
Voted
SAC
2008
ACM
15 years 5 months ago
2008
ACM
We address in this paper the problem of jointly scheduling hard periodic tasks and soft aperiodic events using the Real-Time Specification for Java (RTSJ). We present the programm...