Bin Packing Problem with Time Lags - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles INFORMS Journal on Computing Year : 2022

Bin Packing Problem with Time Lags


We introduce and motivate a variant of the bin packing problem where bins are assigned to time slots, and minimum and maximum lags are required between some pairs of items. We suggest two integer programming formulations for the problem: a compact one, and a stronger formulation with an exponential number of variables and constraints. We propose a branch-cut-and-price approach which exploits the latter formulation. For this purpose, we devise separation algorithms based on a mathematical characterization of feasible assignments for two important special cases of the problem. Computational experiments are reported for instances inspired from a real-case application of chemical treatment planning in vineyards, as well as for literature instances for special cases of the problem. The experimental results show the efficiency of our branch-cut-and-price approach, as it outperforms the compact formulation of newly proposed instances, and is able to obtain improved lower and upper bounds for literature instances.
Fichier principal
Vignette du fichier
main_final_clear.pdf (538.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02986895 , version 1 (03-11-2020)
hal-02986895 , version 2 (14-12-2022)



Orlando Rivera Letelier, François Clautiaux, Ruslan Sadykov. Bin Packing Problem with Time Lags. INFORMS Journal on Computing, 2022, 34 (4), pp.2249-2270. ⟨10.1287/ijoc.2022.1165⟩. ⟨hal-02986895v2⟩
161 View
537 Download



Gmail Facebook X LinkedIn More