An aptas for generalized cost variable-sized bin packing

Leah Epstein, Asaf Levin

Research output: Contribution to journalArticlepeer-review

Abstract

Bin packing is a well-known problem which has a large number of applications. Classical bin packing is a simple model in which all bins are identical. In the bin packing problem with variable-sized bins, we are given a supply of a variety of sizes. This latter model assumes, however, that the cost of a bin is always defined to be its exact size. In this paper we study the more general problem where an available bin size is associated with a fixed cost, which may be smaller or larger than its size. The costs of different bin sizes are unrelated. This generalized problem has various applications in storage and scheduling. In order to generalize previous work, we design new rounding and allocation methods. Our main result is an asymptotic polynomial time approximation scheme for the generalized problem.

Original languageEnglish
Pages (from-to)411-428
Number of pages18
JournalSIAM Journal on Computing
Volume38
Issue number1
DOIs
StatePublished - 2008

Keywords

  • Approximation algorithm
  • Bin packing
  • Worst case analysis

ASJC Scopus subject areas

  • Computer Science (all)
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'An aptas for generalized cost variable-sized bin packing'. Together they form a unique fingerprint.

Cite this