Work

Tight Bounds for Dynamic Bin Packing with Predictions

Year: 2025

Type: article

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.

Source: ACM SIGMETRICS Performance Evaluation Review

DOI: 10.1145/3744970.3727322

Authors: Mozhengfu Liu, Xueyan Tang

Institutions: Northwestern University, Nanyang Technological University

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: bronze

Funders: Ministry of Education - Singapore, Ministry of Education, India

Awards: G6153572166, G6854926366