Bin stretching revisited

Leah Epstein

doi:10.1007/s00236-002-0102-7

Bin stretching revisited

Leah Epstein

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

Abstract

We study three on-line models of bin stretching on two machines. For the case where the machines are identical and the jobs arrive sorted by non-increasing sizes, we show a tight bound of 10/9 on the competitive ratio. For two related machines, we show a preemptive algorithm with competitive ratio 1 for any speed ratio, and two new non-preemptive algorithms. We prove that the upper bound on the competitive ratio achieved by the non-preemptive algorithms is optimal for almost any speed ratio, and close to optimal for all other speed ratios.

Original language	English
Pages (from-to)	97-117
Number of pages	21
Journal	Acta Informatica
Volume	39
Issue number	2
DOIs	https://doi.org/10.1007/s00236-002-0102-7
State	Published - 1 Feb 2003
Externally published	Yes

ASJC Scopus subject areas

Software
Information Systems
Computer Networks and Communications

Access to Document

10.1007/s00236-002-0102-7

Cite this

@article{368bd8e2dc07419390491ce20f376999,

title = "Bin stretching revisited",

abstract = "We study three on-line models of bin stretching on two machines. For the case where the machines are identical and the jobs arrive sorted by non-increasing sizes, we show a tight bound of 10/9 on the competitive ratio. For two related machines, we show a preemptive algorithm with competitive ratio 1 for any speed ratio, and two new non-preemptive algorithms. We prove that the upper bound on the competitive ratio achieved by the non-preemptive algorithms is optimal for almost any speed ratio, and close to optimal for all other speed ratios.",

author = "Leah Epstein",

year = "2003",

month = feb,

day = "1",

doi = "10.1007/s00236-002-0102-7",

language = "English",

volume = "39",

pages = "97--117",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Bin stretching revisited

AU - Epstein, Leah

PY - 2003/2/1

Y1 - 2003/2/1

N2 - We study three on-line models of bin stretching on two machines. For the case where the machines are identical and the jobs arrive sorted by non-increasing sizes, we show a tight bound of 10/9 on the competitive ratio. For two related machines, we show a preemptive algorithm with competitive ratio 1 for any speed ratio, and two new non-preemptive algorithms. We prove that the upper bound on the competitive ratio achieved by the non-preemptive algorithms is optimal for almost any speed ratio, and close to optimal for all other speed ratios.

AB - We study three on-line models of bin stretching on two machines. For the case where the machines are identical and the jobs arrive sorted by non-increasing sizes, we show a tight bound of 10/9 on the competitive ratio. For two related machines, we show a preemptive algorithm with competitive ratio 1 for any speed ratio, and two new non-preemptive algorithms. We prove that the upper bound on the competitive ratio achieved by the non-preemptive algorithms is optimal for almost any speed ratio, and close to optimal for all other speed ratios.

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

U2 - 10.1007/s00236-002-0102-7

DO - 10.1007/s00236-002-0102-7

M3 - Article

AN - SCOPUS:0037331387

SN - 0001-5903

VL - 39

SP - 97

EP - 117

JO - Acta Informatica

JF - Acta Informatica

IS - 2

ER -

Bin stretching revisited

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this