Online-Scheduling on Identical Machines with Bounded Migration

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI:10.1109/SYNASC.2013.54

Thorsten Ehlers, K. Jansen

引用次数: 2

Abstract

We present a robust EPTAS for scheduling on identical machines. The running time for adding one job is bounded by 2^O((1/ε2) log^3(1/ε)). The migration factor required to gain a (1+ ε)-approximate schedule in each iteration is bounded by 2^{O((1/ε) log2(1/ε))}.

查看原文本刊更多论文

具有有界迁移的同机在线调度

我们提出了一个鲁棒的EPTAS在相同机器上的调度。添加一个作业的运行时间限定为2O((1/ε2) log3(1/ε))。在每次迭代中获得(1+ ε)近似调度所需的迁移因子被限定为2O((1/ε) log2(1/ε))。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量