Online reusable resource assortment planning with customer-dependent usage durations
Tianming Huo1, Wang Chi Cheung2
1National University of Singapore, Singapore; 2National University of Singapore, Singapore
We study an adversarial online assortment problem with reusable resources and customer-dependent usage durations. We propose a novel online algorithm which features rejection durations filtering out unprofitable products. We show that it achieves a competitive ratio within a constant factor from the best possible one with large capacities. This is the first work that derives a non-trivial performance guarantee for such problem. We further extend our algorithm framework to other reward functions.