http://repub.eur.nl/res/aut/14427/ List of Publications en http://repub.eur.nl/static-eur/img/logo.png http://repub.eur.nl http://repub.eur.nl/res/pub/11700/ 1993-09-03T00:00:00Z The first algorithms for the on-line two-dimensional rectangle packing problem were introduced by Coppersmith and Raghavan. They showed that for a family of heuristics 13/4 is an upper bound for the asymptotic worst-case ratios. We have investigated the Next Fit and the First Fit variants of their method. We proved that the asymptotic worst-case ratio equals 13/4 for the Next Fit variant and that 49/16 is an upper bound of the asymptotic worst-case ratio for the First Fit variant. http://repub.eur.nl/res/pub/11733/ 1991-06-01T00:00:00Z In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0, 1] and reveal the connection between this problem and the classical bin packing problem as well as to renewal theory. http://repub.eur.nl/res/pub/11738/ 1990-01-01T00:00:00Z http://repub.eur.nl/res/pub/11645/ 1986-11-01T00:00:00Z A probabilistic analysis is presented of the Next Fit Decreasing bin packing heuristic, in which bins are opened to accomodate the items in order of decreasing size.