This repository contains compact models for the Temporal Bin Packing Problem with Fire-Ups. The problem was introduced in [1]. Some improvements for the basic models were proposed in [2] and [3] (cf. the repository tbpp-cf2). A preliminary version of a paper explaining the implemented models can be found in [4].
Example files are contained in the examples directory.
pip install .
The data for the benchmark instances can be found here and here.
[1] Aydın, N., Muter, İ., & Birbil, Ş. İ. (2020). Multi-objective temporal bin packing problem: An application in cloud computing. Computers & Operations Research, 121, 104959.
[2] Martinovic, J., Strasdat, N., & Selch, M. (2021). Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. Computers & Operations Research, 105288.
[3] Martinovic, J., Strasdat, N., Valério de Carvalho, J., & Furini, F. (2022). Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optimization Letters, 1-26.
[4] Martinovic, J. & Strasdat, N. (2022). Theoretical Insights and a New Class of Valid Inequalities for the Temporal Bin Packing Problem with Fire-Ups. Preprint MATH-NM-01-2022, Technische Universität Dresden