Semi-Online Preemptive Scheduling: One Algorithm for All Variants

被引：0
|
作者：
Tomáš Ebenlendr
Jiří Sgall
机构：
[1] AS CR,Institute of Mathematics
[2] Žitná 25,Dept. of Applied Mathematics, Faculty of Mathematics and Physics
[3] Charles University,undefined
[4] Malostranské nám. 25,undefined
来源：
Theory of Computing Systems | 2011年 / 48卷
关键词：
Online algorithms; Scheduling; Preemption; Linear program;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.
引用
收藏
页码：577 / 613
页数：36
相关论文
共 50 条
12345