Vector Bin Packing with Multiple-Choice release_6fnbo4e2vrdsfp77ftcr4iqrsm

by Boaz Patt-Shamir, Dror Rawitz

Released as a article .

2009  

Abstract

We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several D-dimensional incarnations. We are also given T bin types, each with its own cost and D-dimensional size. Our goal is to pack the items in a set of bins of minimum overall cost. The problem is motivated by scheduling in networks with guaranteed quality of service (QoS), but due to its general formulation it has many other applications as well. We present an approximation algorithm that is guaranteed to produce a solution whose cost is about D times the optimum. For the running time to be polynomial we require D=O(1) and T=O( n). This extends previous results for vector bin packing, in which each item has a single incarnation and there is only one bin type. To obtain our result we also present a PTAS for the multiple-choice version of multidimensional knapsack, where we are given only one bin and the goal is to pack a maximum weight set of (incarnations of) items in that bin.
In text/plain format

Archived Files and Locations

application/pdf  186.4 kB
file_6gxwo2yobff3jc2zttfi6q55cu
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2009-10-29
Version   v1
Language   en ?
arXiv  0910.5599v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f85b5401-eef9-4658-9b30-95224951810f
API URL: JSON