We prove new lower bounds for suitable competitive ratio measures of two relaxed online packing problems: online removable multiple knapsack, and a recently introduced online minimum peak appointment scheduling problem. The high level objective in both problems is to pack arriving items of sizes at most 1 into bins of capacity 1 as efficiently as possible, but the exact formalizations differ. In the appointment scheduling problem, every item has to be assigned to a position, which can be seen as a time interval during a workday of length 1. That is, items are not assigned to bins, but only once all the items are processed, the optimal number of bins subject to chosen positions is determined, and this is the cost of the online algorithm. On the other hand, in the removable knapsack problem there is a fixed number of bins, and the goal of packing items, which consists in choosing a particular bin for every packed item (and nothing else), is to pack as valuable a subset as possible. In this last problem it is possible to reject items, that is, deliberately not pack them, as well as to remove packed items at any later point in time, which adds flexibility to the problem.
|Title of host publication||Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Proceedings|
|Editors||Cristina Bazgan, Henning Fernau|
|Publisher||Springer Science and Business Media Deutschland GmbH|
|Number of pages||13|
|State||Published - 2022|
|Event||33rd International Workshop on Combinatorial Algorithms, IWOCA 2022 - Trier, Germany|
Duration: 7 Jun 2022 → 9 Jun 2022
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||33rd International Workshop on Combinatorial Algorithms, IWOCA 2022|
|Period||7/06/22 → 9/06/22|
Bibliographical noteFunding Information:
̷L. Jeż was supported by the Polish National Science Center grant 2020/39/B/ST6/ 01679.
© 2022, Springer Nature Switzerland AG.
- Bin packing
- Competitive ratio
- Online algorithms
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)