35 search results - page 2 / 7 » Scheduling with Release Times and Deadlines on a Minimum Num... |
IPL
2008
13 years 5 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
COR
2011
12 years 11 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...