Optimal online-list batch scheduling
We consider the online-list batch scheduling problem. jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem. (C) 2009 Elsevier B.V. All rights reserved.
batch scheduling online algorithms competitive analysis