706 search results - page 31 / 142 » Online Interval Scheduling |
EOR
2008
13 years 7 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
EOR
2010
13 years 7 months ago
2010
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...