Optimally competitive list batching

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

doi:10.1007/978-3-540-27810-8_8

Optimally competitive list batching

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

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Torben Hagerup, Jyrki Katajainen
Publisher	Springer Verlag
Pages	77-89
Number of pages	13
ISBN (Electronic)	3540223398, 9783540223399
DOIs	https://doi.org/10.1007/978-3-540-27810-8_8
State	Published - 2004
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3111
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

Batching
Design of Algorithms
Online Algorithms
TCP acknowledgement

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-27810-8_8

Cite this

Bein, W. W., Epstein, L., Larmore, L. L., & Noga, J. (2004). Optimally competitive list batching. In T. Hagerup, & J. Katajainen (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 77-89). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3111). Springer Verlag. https://doi.org/10.1007/978-3-540-27810-8_8

Bein, Wolfgang W. ; Epstein, Leah ; Larmore, Lawrence L. et al. / Optimally competitive list batching. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Torben Hagerup ; Jyrki Katajainen. Springer Verlag, 2004. pp. 77-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

}

Bein, WW, Epstein, L, Larmore, LL & Noga, J 2004, Optimally competitive list batching. in T Hagerup & J Katajainen (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3111, Springer Verlag, pp. 77-89. https://doi.org/10.1007/978-3-540-27810-8_8

Optimally competitive list batching. / Bein, Wolfgang W.; Epstein, Leah; Larmore, Lawrence L. et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Torben Hagerup; Jyrki Katajainen. Springer Verlag, 2004. p. 77-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3111).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Optimally competitive list batching

AU - Bein, Wolfgang W.

AU - Epstein, Leah

AU - Larmore, Lawrence L.

AU - Noga, John

PY - 2004

Y1 - 2004

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

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

KW - Batching

KW - Design of Algorithms

KW - Online Algorithms

KW - TCP acknowledgement

UR - https://www.scopus.com/pages/publications/35048832903

U2 - 10.1007/978-3-540-27810-8_8

DO - 10.1007/978-3-540-27810-8_8

M3 - Chapter

AN - SCOPUS:35048832903

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 77

EP - 89

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Hagerup, Torben

A2 - Katajainen, Jyrki

PB - Springer Verlag

ER -

Bein WW, Epstein L, Larmore LL, Noga J. Optimally competitive list batching. In Hagerup T, Katajainen J, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 77-89. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-27810-8_8

Optimally competitive list batching

Abstract

Publication series

UN SDGs

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this