In this paper we present a dual approximation scheme for the class constrained shelf bin packing problem. In this problem, we are given bins of capacity , and items of different classes, each item with class and size . The problem is to pack the items into bins, such that two items of different classes packed in a same bin must be in different shelves. Items in a same shelf are packed consecutively. Moreover, items in consecutive shelves must be separated by shelf divisors of size . In...
In this paper we present a dual approximation scheme for the class
constrained shelf bin packing problem.
In this problem, we are given bins of capacity , and items of
different classes, each item with class
and size
. The problem is to pack the items into bins, such that
two items of different classes packed in a same bin must be in
different shelves.
Items in a same shelf are packed consecutively.
Moreover, items in consecutive shelves must be separated by...
In this paper we address the two-dimensional knapsack problem with unloading constraints: we have a bin , and a list of rectangular items, each item with a class value in {1,...,}. The problem is to pack a subset of into , maximizing the total profit of packed items, where the packing must satisfy the unloading constraint: while removing one item , items with higher class values can not block . We present a (4 + )-approximation algorithm when the bin is a square. We also present (3 + )-approximation...
Download Results (CSV)