75 search results - page 1 / 15 » Online Scheduling on Identical Machines using SRPT |
71
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
IPPS
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
ANOR
2010
14 years 7 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
101
click to vote
STOC
1997
ACM
15 years 1 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
COCOON
2005
Springer
15 years 2 months ago
2005
Springer
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...