173 search results - page 4 / 35 » Special Cases of Online Parallel Job Scheduling |
DFG
2009
Springer
14 years 2 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
ESA
2009
Springer
14 years 16 days ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
JCO
2010
13 years 6 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
STOC
1997
ACM
14 years 3 days 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...
MFCS
1994
Springer
14 years 5 hour ago
1994
Springer