475 search results - page 31 / 95 » Feasible distributed CSP models for scheduling problems |
144
click to vote
ECRTS
2008
IEEE
15 years 11 months ago
2008
IEEE
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
176
click to vote
EOR
2007
15 years 4 months ago
2007
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
132
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
141
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
146
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...