Optimal online-list batch scheduling

Authors:
Jacob Jan Paulus;Deshi Ye;Guochuan Zhang
Affiliations:
University of Twente, PO Box 217, 7500AE Enschede, The Netherlands;College of Computer Science, Zhejiang University, Hangzhou 310027, China;College of Computer Science, Zhejiang University, Hangzhou 310027, China
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 0

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Searching in the plane

Information and Computation
Scheduling Algorithms

Scheduling Algorithms
Incremental Medians via Online Bidding

Algorithmica

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.