Approximating robust bin-packing with budgeted uncertainty

Aniket Roy 1 Marin Bougeret 2 Noam Goldberg 3 Michael Poss 1
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We consider robust variants of the bin-packing problem where the sizes of the items can take any value in a given uncertainty set U ⊆ × n i=1 [ai, ai + ˆ ai], where a ∈ [0, 1] n represents the nominal sizes of the items andâandˆandâ ∈ [0, 1] n their possible deviations. We consider more specifically two uncertainty sets previously studied in the literature. The first set, denoted U Γ , contains scenarios in which at most Γ ∈ N items deviate, each of them reaching its peak value ai + ˆ ai, while each other item has its nominal value ai. The second set, denoted U Ω , bounds by Ω ∈ [0, 1] the total amount of deviation in each scenario. We show that a variant of the next-fit algorithm provides a 2-approximation for model U Ω , and a 2(Γ +1) approximation for model U Γ (which can be improved to 2 approximation for Γ = 1). This motivates the question of the existence of a constant ratio approximation algorithm for the U Γ model. Our main result is to answer positively to this question by providing a 4.5 approximation for U Γ model based on dynamic programming.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Michael Poss <>
Submitted on : Friday, May 3, 2019 - 5:00:21 PM
Last modification on : Wednesday, May 8, 2019 - 1:29:41 AM


WADS19_full_version (1).pdf
Files produced by the author(s)


  • HAL Id : hal-02119351, version 1



Aniket Roy, Marin Bougeret, Noam Goldberg, Michael Poss. Approximating robust bin-packing with budgeted uncertainty. 2019. ⟨hal-02119351⟩



Record views


Files downloads