FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\). (Q2641215): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3347319 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic analysis for simple one- and two-dimensional bin packing algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3879185 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4101255 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3218851 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01759043 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1970694622 / rank | |||
Normal rank |
Latest revision as of 10:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\). |
scientific article |
Statements
FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\). (English)
0 references
1991
0 references
We study the expected behavior of the FFD bin-packing algorithm applied to items whose sizes are distributed in accordance with a Poisson process with rate N on the interval [0,1/2] of item sizes. By viewing the algorithm as a succession of queueing processes we show that the expected wasted space for FFD bin-packing is bounded above by 11.3 bins, independent of N.
0 references
probabilistic analysis
0 references
expected behavior
0 references
FFD bin-packing algorithm
0 references