Abstract
We consider the Ordered Open End Bin Packing problem. Items of sizes in (0, 1] are presented one by one, to be assigned to bins in this order. An item can be assigned to any bin for which the current total size is strictly below 1. This means also that the bin can be overloaded by its last packed item. We improve lower and upper bounds on the asymptotic competitive ratio in the online case. Specifically, we design the first algorithm whose asymptotic competitive ratio is strictly below 2, and its value is close to the lower bound. This is in contrast to the best possible absolute competitive ratio, which is equal to 2. We also study the offline problem where the sequence of items is known in advance, while items are still assigned to bins based on their order in the sequence. For this scenario, we design an asymptotic polynomial time approximation scheme.
| Original language | English |
|---|---|
| Pages (from-to) | 589-614 |
| Number of pages | 26 |
| Journal | Journal of Scheduling |
| Volume | 24 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 2021 |
Bibliographical note
Funding Information:J. Balogh: This research was supported by the projects “Extending the activities of the HU-MATHS-IN Hungarian Industrial and Innovation Mathematical Service Network” EFOP-3.6.2-16-2017-00015, and the project “Integrated program for training new generation of scientists in the fields of computer science” EFOP-3.6.3-VEKOP-16-2017-00002, supported by the European Union and co-funded by the European Social Fund. A. Levin: Partially supported by grant number 308/18 of ISF - Israeli Science Foundation.
Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Approximation scheme
- Bin packing
- Online algorithms
ASJC Scopus subject areas
- Software
- Engineering (all)
- Management Science and Operations Research
- Artificial Intelligence