On-line bin-stretching

Yossi Azar, Oded Regev

Research output: Contribution to journalArticle

Abstract

We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we fix the size of the bins and try to pack the items in the minimum number of such bins. In contrast, in the bin-stretching problem we fix the number of bins and try to pack the items while stretching the size of the bins as least as possible. We present two on-line algorithms for the bin-stretching problem that guarantee a stretching factor of 5/3 for any number m of bins. We then combine the two algorithms and design an algorithm whose stretching factor is 1.625 for any m. The analysis for the performance of this algorithm is tight. The best lower bound for any algorithm is 4/3 for any m≥2. We note that the bin-stretching problem is also equivalent to the classical scheduling (load balancing) problem in which the value of the makespan (maximum load) is known in advance.

Original languageEnglish (US)
Pages (from-to)17-41
Number of pages25
JournalTheoretical Computer Science
Volume268
Issue number1
DOIs
StatePublished - Oct 6 2001

Fingerprint

Bins
Stretching
Bin Packing Problem
Load Balancing
Scheduling
Lower bound
Unit
Resource allocation

Keywords

  • Approximation algorithms
  • Bin stretching
  • Bin-packing
  • Load balancing
  • On-line algorithms
  • Scheduling

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On-line bin-stretching. / Azar, Yossi; Regev, Oded.

In: Theoretical Computer Science, Vol. 268, No. 1, 06.10.2001, p. 17-41.

Research output: Contribution to journalArticle

Azar, Yossi ; Regev, Oded. / On-line bin-stretching. In: Theoretical Computer Science. 2001 ; Vol. 268, No. 1. pp. 17-41.
@article{409daaf10981452983a04df6b28dbd4d,
title = "On-line bin-stretching",
abstract = "We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we fix the size of the bins and try to pack the items in the minimum number of such bins. In contrast, in the bin-stretching problem we fix the number of bins and try to pack the items while stretching the size of the bins as least as possible. We present two on-line algorithms for the bin-stretching problem that guarantee a stretching factor of 5/3 for any number m of bins. We then combine the two algorithms and design an algorithm whose stretching factor is 1.625 for any m. The analysis for the performance of this algorithm is tight. The best lower bound for any algorithm is 4/3 for any m≥2. We note that the bin-stretching problem is also equivalent to the classical scheduling (load balancing) problem in which the value of the makespan (maximum load) is known in advance.",
keywords = "Approximation algorithms, Bin stretching, Bin-packing, Load balancing, On-line algorithms, Scheduling",
author = "Yossi Azar and Oded Regev",
year = "2001",
month = "10",
day = "6",
doi = "10.1016/S0304-3975(00)00258-9",
language = "English (US)",
volume = "268",
pages = "17--41",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - On-line bin-stretching

AU - Azar, Yossi

AU - Regev, Oded

PY - 2001/10/6

Y1 - 2001/10/6

N2 - We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we fix the size of the bins and try to pack the items in the minimum number of such bins. In contrast, in the bin-stretching problem we fix the number of bins and try to pack the items while stretching the size of the bins as least as possible. We present two on-line algorithms for the bin-stretching problem that guarantee a stretching factor of 5/3 for any number m of bins. We then combine the two algorithms and design an algorithm whose stretching factor is 1.625 for any m. The analysis for the performance of this algorithm is tight. The best lower bound for any algorithm is 4/3 for any m≥2. We note that the bin-stretching problem is also equivalent to the classical scheduling (load balancing) problem in which the value of the makespan (maximum load) is known in advance.

AB - We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we fix the size of the bins and try to pack the items in the minimum number of such bins. In contrast, in the bin-stretching problem we fix the number of bins and try to pack the items while stretching the size of the bins as least as possible. We present two on-line algorithms for the bin-stretching problem that guarantee a stretching factor of 5/3 for any number m of bins. We then combine the two algorithms and design an algorithm whose stretching factor is 1.625 for any m. The analysis for the performance of this algorithm is tight. The best lower bound for any algorithm is 4/3 for any m≥2. We note that the bin-stretching problem is also equivalent to the classical scheduling (load balancing) problem in which the value of the makespan (maximum load) is known in advance.

KW - Approximation algorithms

KW - Bin stretching

KW - Bin-packing

KW - Load balancing

KW - On-line algorithms

KW - Scheduling

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

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

U2 - 10.1016/S0304-3975(00)00258-9

DO - 10.1016/S0304-3975(00)00258-9

M3 - Article

AN - SCOPUS:0035818334

VL - 268

SP - 17

EP - 41

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -