554 search results - page 33 / 111 » Approximability of OFDMA Scheduling |
132
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
160
click to vote
HIPC
2007
Springer
15 years 8 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
167
click to vote
ECRTS
2009
IEEE
15 years 1 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
161
click to vote
ICTCS
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
142
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...