@inbook{b4e846506b5847539b4f7c07726fd9a6,
title = "Optimally competitive list batching",
abstract = "Batching has been studied extensively in the offline case, but many applications such as manufacturing or TCP acknowledgement require online solutions. We consider online batching problems, where the order of jobs to be batched is fixed and where we seek to minimize average flow time. We present optimally competitive algorithms for s-batch (competitive ratio 2) and p-batch problems (competitive ratio of 4). We also derive results for naturally occurring special cases. In particular, we consider the case of unit processing times.",
keywords = "Batching, Design of Algorithms, Online Algorithms, TCP acknowledgement",
author = "Bein, {Wolfgang W.} and Leah Epstein and Larmore, {Lawrence L.} and John Noga",
year = "2004",
doi = "10.1007/978-3-540-27810-8_8",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "77--89",
editor = "Torben Hagerup and Jyrki Katajainen",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}