On-line bin-stretching

Yossi Azar, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x 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 x 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)
Title of host publicationRandomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings
PublisherSpringer Verlag
Pages71-81
Number of pages11
Volume1518
ISBN (Print)354065142X, 9783540651420
DOIs
StatePublished - 1998
Event2nd International Workshop on Randomization and Approximation Techniques in Computer Science, Random 1998 - Barcelona, Spain
Duration: Oct 8 1998Oct 10 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1518
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Workshop on Randomization and Approximation Techniques in Computer Science, Random 1998
CountrySpain
CityBarcelona
Period10/8/9810/10/98

Fingerprint

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

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Azar, Y., & Regev, O. (1998). On-line bin-stretching. In Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings (Vol. 1518, pp. 71-81). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1518). Springer Verlag. https://doi.org/10.1007/3-540-49543-6_7

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

Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. Vol. 1518 Springer Verlag, 1998. p. 71-81 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1518).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Azar, Y & Regev, O 1998, On-line bin-stretching. in Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. vol. 1518, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1518, Springer Verlag, pp. 71-81, 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, Random 1998, Barcelona, Spain, 10/8/98. https://doi.org/10.1007/3-540-49543-6_7
Azar Y, Regev O. On-line bin-stretching. In Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. Vol. 1518. Springer Verlag. 1998. p. 71-81. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-49543-6_7
Azar, Yossi ; Regev, Oded. / On-line bin-stretching. Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. Vol. 1518 Springer Verlag, 1998. pp. 71-81 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9528baff6e604ea3a5f72845acb7896e,
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 x 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 x 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-packing, Bin-stretching, Load balancing, On-line algorithms, Scheduling",
author = "Yossi Azar and Oded Regev",
year = "1998",
doi = "10.1007/3-540-49543-6_7",
language = "English (US)",
isbn = "354065142X",
volume = "1518",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "71--81",
booktitle = "Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings",

}

TY - GEN

T1 - On-line bin-stretching

AU - Azar, Yossi

AU - Regev, Oded

PY - 1998

Y1 - 1998

N2 - We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x 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 x 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 x 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 x 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-packing

KW - Bin-stretching

KW - Load balancing

KW - On-line algorithms

KW - Scheduling

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

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

U2 - 10.1007/3-540-49543-6_7

DO - 10.1007/3-540-49543-6_7

M3 - Conference contribution

SN - 354065142X

SN - 9783540651420

VL - 1518

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

SP - 71

EP - 81

BT - Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings

PB - Springer Verlag

ER -