2714 search results - page 4 / 543 » Approximation Schemes for Scheduling |
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
RTSS
2000
IEEE
15 years 1 months ago
2000
IEEE
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
96
Voted
EMSOFT
2007
Springer
15 years 1 months ago
2007
Springer
This paper deals with energy-aware real-time system scheduling using dynamic voltage scaling (DVS) for energy-constrained embedded systems that execute variable and unpredictable ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...