Semi-Online Algorithms for the Hierarchical Extensible Bin-Packing Problem and Early Work Problem

• Published in: Computation Vol. 12; no. 4; p. 68
• Main Authors: Yang, Yaru, Xiao, Man, Li, Weidong
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01-04-2024
• Subjects: Algorithms; Approximation; Bins; Combinatorial optimization; Competition; competitive ratio; early work; Employment; Extensibility; Hierarchies; hierarchy; Lower bounds; Methods; Packing problem; Scheduling; Scheduling (Management); semi-online; China
• ISSN: 2079-3197; 2079-3197
• DOI: 10.3390/computation12040068

In this paper, we consider two types of semi-online problems with hierarchies. In the extensible bin-packing problem with two hierarchical bins, one bin can pack all items, while the other bin can only pack some items. The initial size of the bin can be expanded, and the goal is to minimize the total size of the two bins. When the largest item size is given in advance, we provide some lower bounds and propose online algorithms. When the total item size is given in advance, we provide some lower bounds and propose online algorithms. In addition, we also consider the relevant early-work-maximization problem on two hierarchical machines; one machine can process any job, while the other machine can only process some jobs. Each job shares a common due date, and the goal is to maximize the total early work. When the largest job size is known, we provide some lower bounds and propose two online algorithms whose competitive ratios are close to the lower bounds.