Elsevier

Journal of Algorithms

Volume 12, Issue 2, June 1991, Pages 189-203
Journal of Algorithms

Probabilistic analysis of algorithms for dual bin packing problems

https://doi.org/10.1016/0196-6774(91)90001-FGet rights and content

Abstract

In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0, 1] and reveal the connection between this problem and the classical bin packing problem as well as to renewal theory.

References (13)

There are more references available in the full text version of this article.

Cited by (36)

  • The skiving stock problem and its relation to hypergraph matchings

    2018, Discrete Optimization
    Citation Excerpt :

    Referring to this, some main areas of applications are given by: Furthermore, also neighboring tasks, such as dual vector packing problems [18,19] or the maximum cardinality bin packing problem [5,20], are often associated with the DBPP. These formulations are of practical use as well since they are applied in multiprocessor scheduling problems [21] or surgical case plannings [22].

  • An upper bound of Δ(E)<3∕2 for skiving stock instances of the divisible case

    2017, Discrete Applied Mathematics
    Citation Excerpt :

    Besides its original application in industrial production and recycling [13,35], the skiving stock problem plays an important role whenever an efficient and sustainable use of given resources is desired. By way of example, the SSP and neighboring tasks (e.g. dual vector packing problems [8] and the maximum cardinality bin packing problem [5,25]) are of high interest in the following fields: stimulating economic activity (e.g. in periods of recession) [16], efficient allocation of wireless users in a given frequency range by means of spectrum-aggregation based resource allocation [19,20,31], multiprocessor scheduling problems [1], and surgical case plannings [33]. Note that, similar to the cutting stock problem, there are also other modeling approaches for the SSP, most notably the arcflow model and the one-stick model [22].

  • Integer rounding and modified integer rounding for the skiving stock problem

    2016, Discrete Optimization
    Citation Excerpt :

    Such computations are of high interest in many real world applications, e.g. industrial production processes (see [2] for an overview) or politico-economic problems (cf. [3,4]). Furthermore, also neighboring tasks, such as dual vector packing problem [6] or the maximum cardinality bin packing problem [7,5], are often associated or even identified with the dual bin packing problem. These formulations are of practical use as well since they are applied in multiprocessor scheduling problems [8] or surgical case plannings [9].

  • Integer linear programming models for the skiving stock problem

    2016, European Journal of Operational Research
View all citing articles on Scopus
View full text