Optimally competitive list batching

Wolfgang Bein, Leah Epstein, Lawrence L. Larmore, John Noga

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)3631-3639
Number of pages9
JournalTheoretical Computer Science
Issue number38-40
StatePublished - 6 Sep 2009

Bibliographical note

Funding 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: bein@cs.unlv.edu (W. Bein), lea@math.haifa.ac.il (L. Epstein), larmore@cs.unlv.edu (L.L. Larmore), jnoga@csun.edu (J. Noga).


  • Batching
  • Design of algorithms
  • Online algorithms
  • TCP acknowledgment

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Optimally competitive list batching'. Together they form a unique fingerprint.

Cite this