Sciweavers

ESA
2009
Springer
109views Algorithms» more  ESA 2009»
13 years 9 months ago
Preemptive Online Scheduling with Reordering
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...
György Dósa, Leah Epstein