|Title:||A Stochastic Analysis of the NFD Bin Packing Algorithm
|Authors:||Micha Hofri and Sami Kamhi
|Abstract:||We consider the Next-Fit-Decreasing (NFD) algorithm for the one-dimensional bin packing problem. The input consists of n pieces of i.i.d. sizes. Bounds on the first two moments are established for arbitrary size distributions. These bounds are asymptptically tight. For the uniform distribution we also exhibit numerical results and examine their dependence on the support of the size distribution.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1984/CS/CS0324), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1984
To the main CS technical reports page
Computer science department, Technion