Bin packing problem with scenarios
- 161 Downloads
Scheduling over scenarios is one of the latest approaches in modelling scheduling problems including uncertainty. However, to the best of our knowledge, scenarios have never been applied to the bin packing problem, so here we introduce the bin packing problem with scenarios. In this model, we have a list of items with sizes between 0 and 1, and each item is assigned to one or more scenarios. In reality, the items of only one scenario will occur, but this chosen scenario is unknown at the time of packing, so the algorithms have to examine all scenarios. This means that the items have to be packed into bins such that for any scenario, the total size of the items in this scenario is at most 1 in each bin. The objective of the standard bin packing problem is to minimize the number of bins. Here, we introduce some extensions of the objective function to the scenario based model, and we present our competitive analysis of some online bin packing algorithms adapted to scenarios.
KeywordsBin packing problem Scenarios Online algorithms Competitive analysis
Mathematics Subject Classification68Q25 68W25 68W40
We were proud to have the opportunity to work with Csanád Imreh, who originally came up with the idea of using scenarios in the bin packing problem, and started investigating this model. After his sudden unexpected death, we carried on researching this problem. It was a pleasure to have known such a devoted researcher. We are also grateful to János Csirik, who helped us and provided useful remarks and suggestions. János Balogh was supported by the European Union, co-financed by the European Social Fund (EFOP-3.6.3-VEKOP-16-2017-00002).
- Bertsimas D (1988) Probabilistic combinatorial optimization problems. Ph.D. thesis, Massachusetts Institute of TechnologyGoogle Scholar
- Dósa G, Sgall J (2013) First fit bin packing: a tight analysis. In: LIPIcs-Leibniz international proceedings in informatics, vol. 20. Schloss Dagstuhl-Leibniz-Zentrum fuer InformatikGoogle Scholar
- Kall P, Wallace SW, Kall P (1994) Stochastic programming. Springer, New YorkGoogle Scholar
- Kasperski A, Zieliński P (2011) Bottleneck combinatorial optimization problems with fuzzy scenarios. In: Nonlinear mathematics for uncertainty and its applications, Springer, pp 197–204Google Scholar
- Kasperski A, Kurpisz A, Zieliński P (2012) Parallel machine scheduling under uncertainty. In: International conference on information processing and management of uncertainty in knowledge-based systems, Springer, pp 74–83Google Scholar
- Prékopa A (2013) Stochastic programming, vol 324. Springer, New YorkGoogle Scholar
- Rischke R (2014) Two-stage robust combinatorial optimization with priced scenarios. In: Operations research proceedings 2013, Springer, pp 377–382Google Scholar