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

This publication has 6 references indexed in Scilit: