TY - GEN
T1 - Minimum weighted sum bin packing
AU - Epstein, Leah
AU - Levin, Asaf
PY - 2008
Y1 - 2008
N2 - We study minimum weighted sum bin packing (MWSBP), which is a bin packing problem where the cost of an item is the index of the bin into which it is packed multiplied by its weight, and the goal is to minimize the total cost of the items. This is equivalent to a batch scheduling problem which we define, where the total weighted completion time is to be minimized. This problem is previously known to be NP-hard in the strong sense even for unit weight items. We design a polynomial time approximation scheme for it, and additionally, a dual polynomial time approximation scheme.
AB - We study minimum weighted sum bin packing (MWSBP), which is a bin packing problem where the cost of an item is the index of the bin into which it is packed multiplied by its weight, and the goal is to minimize the total cost of the items. This is equivalent to a batch scheduling problem which we define, where the total weighted completion time is to be minimized. This problem is previously known to be NP-hard in the strong sense even for unit weight items. We design a polynomial time approximation scheme for it, and additionally, a dual polynomial time approximation scheme.
UR - http://www.scopus.com/inward/record.url?scp=49949094617&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-77918-6_18
DO - 10.1007/978-3-540-77918-6_18
M3 - Conference contribution
AN - SCOPUS:49949094617
SN - 3540779175
SN - 9783540779179
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 218
EP - 231
BT - Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
T2 - 5th International Workshop on Approximation and Online Algorithms, WAOA 2007
Y2 - 11 October 2007 through 12 October 2007
ER -