Abstract

We make a stochastic analysis of a modified version mFFD of First Fit Decreasing, in which each bin is closed after it receives its first fallback item. Consider a probability measure μ on [0, 1], and independent random variables X1, …, Xn distributed according to μ. Let Rn = R(X1, …, Xn) be the number of unit size bins that mFFD needs to pack items of size X1, …, Xn. We prove that c(μ) = limn→∞ E(Rn)/n exists and that the random variable (Rn − nc(μ))/√n converges in distribution. The main tools are deterministic inequalities concerning mFFD, that might be of independent interest.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.