64 search results - page 7 / 13 » Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim... |
ICALP
2000
Springer
14 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...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
ESA
2007
Springer
14 years 4 months ago
2007
Springer
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for savin...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
AAIM
2007
Springer
14 years 4 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...