We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks for finding the minimum number of bins to pack all the items while respecting the bin capacity at any time instant. A polynomial-size formulation, an exponential-size formulation, and a number of lower and upper bounds are studied. A branch-and-price algorithm for solving the exponential-size formulation is introduced. An overall algorithm combining the different methods is then proposed and tested through extensive computational experiments.

A branch-and-price algorithm for the temporal bin packing problem / Dell'Amico, M.; Furini, F.; Iori, M.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 114:(2020), pp. 1-16. [10.1016/j.cor.2019.104825]

### A branch-and-price algorithm for the temporal bin packing problem

#### Abstract

We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks for finding the minimum number of bins to pack all the items while respecting the bin capacity at any time instant. A polynomial-size formulation, an exponential-size formulation, and a number of lower and upper bounds are studied. A branch-and-price algorithm for solving the exponential-size formulation is introduced. An overall algorithm combining the different methods is then proposed and tested through extensive computational experiments.
##### Scheda breve Scheda completa Scheda completa (DC)
11-ott-2019
114
1
16
A branch-and-price algorithm for the temporal bin packing problem / Dell'Amico, M.; Furini, F.; Iori, M.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 114:(2020), pp. 1-16. [10.1016/j.cor.2019.104825]
Dell'Amico, M.; Furini, F.; Iori, M.
File in questo prodotto:
File
1902.04925.pdf

accesso aperto

Descrizione: Versione pre print
Tipologia: Pre-print dell'autore (bozza pre referaggio)
Dimensione 310.96 kB
1-s2.0-S0305054819302679-main.pdf

non disponibili

Tipologia: Versione dell'editore (versione pubblicata)
Dimensione 1.02 MB
##### Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/11380/1186978`
• ND
• 19
• 16