Abstract
Given a collection of items and a number of unit size bins, the dual bin packing problem requires finding the largest number of items that can be packed in these bins. In our stochastic model, the item sizesX 1,⋯,X n are independent identically distributed according to a given probability measureμ. Denote byN n =N n (X 1,⋯,X n ) the largest number of these items that can be packed in ⌊an⌋ bins, where 0<a<1 is a constant. We show thatb = lim n→∞ E(N n )/n exists, and that the random variable (N n −nb)/\(\sqrt n \) converges in distribution. The limit is identified as the distribution of the supremum of a certain Gaussian process cannonically attached toμ.
Similar content being viewed by others
References
L. Breiman,Probability (Addison-Wesley, Reading, MA, 1968).
J.L. Bruno and P.J. Downey, “Probabilistic bounds for dual bin packing,”Acta Informatica 22 (1985) 333–345.
E.G. Coffman Jr., J.Y. Leung and D.W. Ting, “Bin packing, maximizing the number of pieces packed,”Acta Informatica 9 (1978) 263–271.
R. Engelking,General Topology (PWN, Warsaw, 1977).
D. Foster and R. Vohra, “Probabilistic analysis of a heuristic for the dual bin packing problem,”Information Processing Letters 31 (1989) 287–290.
J. Komlós, P. Major and G. Tuesnády, “An approximation of partial sums of independent random variables and the sample DFI,”Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 32 (1975) 111–131.
W. Rhee and M. Talagrand, “Martingale inequality and NP-complete problems,”Mathematics of Operation Research 12(1) (1987) 177–181.
W. Rhee, “Optimal bin packing with items of random sizes,”Mathematics of Operation Research 13(1) (1988) 140–151.
W. Rhee and M. Talagrand, “Optimal bin packing with items of random size -II,”SIAM Journal on Computing 18 (1989) 139–151.
W. Rhee and M. Talagrand, “Optimal bin packing with items of random size -III,”SIAM Journal on Computing 18 (1989) 473–486.
Author information
Authors and Affiliations
Additional information
This research is in part supported by NSF grant CCR-8801517 and CCR-9000611.
This research is in part supported by NSF grant DMS-8801180.
Rights and permissions
About this article
Cite this article
Rhee, W.T., Talagrand, M. Dual bin packing with items of random sizes. Mathematical Programming 58, 229–242 (1993). https://doi.org/10.1007/BF01581268
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581268