Max-min Online Allocations with a Reordering Buffer

We consider online scheduling so as to maximize the minimum load, using a reordering buffer which can store some of the jobs before they are assigned irrevocably to machines. For m identical machines, we show an upper bound of Hm−1 + 1 for a buffer of size m − 1. A competitive ratio below Hm is not possible with any fixed buffer size, and it requires a… CONTINUE READING