The Best-Fit Rule for Multibin Packing: An Extension of Graham's List Algorithms - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2005

The Best-Fit Rule for Multibin Packing: An Extension of Graham's List Algorithms

Résumé

In this paper, we deal with multibin packing problems. These problems are linked to multiprocessor-task scheduling as well as to bin packing problems: they consist of n objects to be packed into m bins, with each object requiring space in several bins. We propose an intuitive greedy approach (the best-fit rule), which extends the well-known list algorithms for multiprocessor scheduling, to solve the case when objects have fixed height and size. We prove that it provides a 2-approximation, and even a 4/3-approximation if the objects are sorted by non-increasing heights. Based on this method, a polynomial time approximation scheme (PTAS) will be developed.
Fichier non déposé

Dates et versions

hal-00361111 , version 1 (13-02-2009)

Identifiants

Citer

Pierre Lemaire, Gerd Finke, Nadia Brauner. The Best-Fit Rule for Multibin Packing: An Extension of Graham's List Algorithms. Graham Kendall, Edmund K. Burke, Sanja Petrovic and Michel Gendreau. Multidisciplinary Scheduling: Theory and Applications, Springer, pp.269-286, 2005, ⟨10.1007/0-387-27744-7_13⟩. ⟨hal-00361111⟩
90 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More