DocumentCode :
2186298
Title :
Online-Scheduling on Identical Machines with Bounded Migration
Author :
Ehlers, Thorsten ; Jansen, Katrien
Author_Institution :
Dept. of Comput. Sci., Univ. Kiel, Kiel, Germany
fYear :
2013
fDate :
23-26 Sept. 2013
Firstpage :
361
Lastpage :
366
Abstract :
We present a robust EPTAS for scheduling on identical machines. The running time for adding one job is bounded by 2O((1/ε2) log3(1/ε)). The migration factor required to gain a (1+ ε)-approximate schedule in each iteration is bounded by 2O((1/ε) log2(1/ε)).
Keywords :
computational complexity; parallel machines; scheduling; bounded migration; identical machines; online scheduling; robust EPTAS; Algorithm design and analysis; Approximation algorithms; Approximation methods; Robustness; Schedules; Scheduling; Vectors; EPTAS; approximation; online algorithm; online scheduling; scheduling on identical machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2013 15th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4799-3035-7
Type :
conf
DOI :
10.1109/SYNASC.2013.54
Filename :
6821171
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2186298
بازگشت