Bin packing with controllable item sizes

We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an allowed size for this item, together with a nonnegative penalty, and an item can be packed using any configuration in its list. The goal is to select a configuration for each item so that the number of unit bins needed to pack the sizes plus the sum of penalties is minimized. This problem has applications in operating systems, bandwidth allocation, and discrete time

• Type: Journal
• Year: 2008
• Where: IANDC
• Authors: José R. Correa, Leah Epstein
• Keywords: Augmented Asymptotic Ptas, IANDC 2008, Nonnegative Penalty, Resource Allocation Problem