Optimally competitive list batching

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

doi:10.1016/j.tcs.2009.04.011

Optimally competitive list batching

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	3631-3639
Number of pages	9
Journal	Theoretical Computer Science
Volume	410
Issue number	38-40
DOIs	https://doi.org/10.1016/j.tcs.2009.04.011
State	Published - 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).

Keywords

Batching
Design of algorithms
Online algorithms
TCP acknowledgment

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1016/j.tcs.2009.04.011

Cite this

@article{1fb711552ad3454b8a6495c120953469,

title = "Optimally competitive list batching",

abstract = "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.",

keywords = "Batching, Design of algorithms, Online algorithms, TCP acknowledgment",

author = "Wolfgang Bein and Leah Epstein and Larmore, {Lawrence L.} and John Noga",

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).",

year = "2009",

month = sep,

day = "6",

doi = "10.1016/j.tcs.2009.04.011",

language = "English",

volume = "410",

pages = "3631--3639",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "38-40",

}

TY - JOUR

T1 - Optimally competitive list batching

AU - Bein, Wolfgang

AU - Epstein, Leah

AU - Larmore, Lawrence L.

AU - Noga, John

N1 - 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).

PY - 2009/9/6

Y1 - 2009/9/6

N2 - 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.

AB - 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.

KW - Batching

KW - Design of algorithms

KW - Online algorithms

KW - TCP acknowledgment

UR - http://www.scopus.com/inward/record.url?scp=68249149586&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2009.04.011

DO - 10.1016/j.tcs.2009.04.011

M3 - Article

AN - SCOPUS:68249149586

VL - 410

SP - 3631

EP - 3639

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 38-40

ER -

Optimally competitive list batching

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this