Online Early Work Maximization on Three Hierarchical Machines with a Common Due Date

被引：0
|
作者：
Xiao, Man [1 ]
Li, Weidong [1 ]
机构：
[1] Yunnan Univ, Sch Math & Stat, Kunming 650504, Yunnan, Peoples R China
来源：
FRONTIERS OF ALGORITHMIC WISDOM, IJTCS-FAW 2022 | 2022年 / 13461卷
基金：
中国国家自然科学基金;
关键词：
Online; Early work; Hierarchy; Competitive ratio; PARALLEL IDENTICAL MACHINES; SEMI; ALGORITHMS; GRADE;
D O I：
10.1007/978-3-031-20796-9_8
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we consider the online early work problems on three hierarchical machines with a common due date. When there is one machine of hierarchy 1, we propose an optimal online algorithm with a competitive ratio of 1.302. When there are two machines of hierarchy 1, we give a lower bound 1.276, and propose an online algorithm with a competitive ratio of 1.302.
引用
收藏
页码：99 / 109
页数：11
相关论文
共 50 条
12345