首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Dual bin packing with items of random sizes
Authors:WanSoo T Rhee  Michel Talagrand
Institution:(1) Faculty of Management Science, The Ohio State University, 43210 Columbus, OH, USA;(2) Equipe d'Analyse, U.A. au C.N.R.S., University of Paris VI, 75230 Paris 05, France;(3) Department of Mathematics, The Ohio State University, 43210 Columbus, OH, USA
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,ctdot,X n are independent identically distributed according to a given probability measuremgr. Denote byN n =N n (X 1,ctdot,X n ) the largest number of these items that can be packed in lflooranrfloor bins, where 0<a<1 is a constant. We show thatb = lim nrarrinfin 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 tomgr. 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.
Keywords:Dual bin packing  Gaussian process  probability
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号