Minimum weighted sum bin packing

Leah Epstein, Asaf Levin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
Number of pages14
StatePublished - 2008
Event5th International Workshop on Approximation and Online Algorithms, WAOA 2007 - Eilat, Israel
Duration: 11 Oct 200712 Oct 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4927 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Workshop on Approximation and Online Algorithms, WAOA 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Minimum weighted sum bin packing'. Together they form a unique fingerprint.

Cite this