Online variable-sized bin packing with conflicts

Leah Epstein, Lene M. Favrholdt, Asaf Levin

Research output: Contribution to journalArticlepeer-review


We study a new kind of online bin packing with conflicts, motivated by a problem arising when scheduling jobs on the Grid. In this bin packing problem, the set of items is given at the beginning, together with a set of conflicts on pairs of items. A conflict on a pair of items implies that they cannot be assigned to a common bin. The online scenario is realized as follows. Variable-sized bins arrive one by one, and items need to be assigned to each bin before the next bin arrives. We analyze the online problem as well as semi-online versions of it, which are the variant where the sizes of the arriving bins are monotonically non-increasing as well as the variant where they are monotonically non-decreasing.

Original languageEnglish
Pages (from-to)333-343
Number of pages11
JournalDiscrete Optimization
Issue number2
StatePublished - May 2011

Bibliographical note

Funding Information:
The second author was supported in part by the Danish Natural Science Research Council (SNF).


  • Bin packing
  • Online algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Online variable-sized bin packing with conflicts'. Together they form a unique fingerprint.

Cite this