Batching has been studied extensively in the offline case, but applications such as manufacturing or TCP acknowledgment often require online solutions. We consider online batching problems, where the order of jobs to be batched is fixed and where we seek to minimize the sum of the completion times of the jobs. We present optimally competitive online algorithms for both s-batch and p-batch problems, and we also derive results for certain naturally occurring special cases, such as the case of unit processing times.
Bibliographical noteFunding Information:
I The research of the first and third authors was supported by NSF grant CCR-0132093. II A preliminary version of this paper appeared in the Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), LNCS volume 3111, Springer,∗ Correspondingauthor.Tel.:+17028951477;fax:+17028955222.pages77–89. E-mail addresses: email@example.com (W. Bein), firstname.lastname@example.org (L. Epstein), email@example.com (L.L. Larmore), firstname.lastname@example.org (J. Noga).
- Design of algorithms
- Online algorithms
- TCP acknowledgment
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)