Abstract
MinUsageTime DBP is a variant of the Dynamic Bin Packing (DBP) problem that seeks to minimize the accumulated length of time for which bins are used in packing a sequence of items. This paper studies the MinUsageTime DBP problem with predictions about item durations. We establish tight competitiveness bounds over the entire spectrum of prediction errors.
Funding Information
  • Ministry of Education, Singapore (MOE-T2EP20122-0007)

This publication has 7 references indexed in Scilit: