文章基本信息

标题：Semi-Online Preemptive Scheduling: One Algorithm for All Variants
本地全文：下载
作者：Tomas Ebenlendr ; Jiri Sgall
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2009
卷号：3
页码：349-360
DOI：10.4230/LIPIcs.STACS.2009.1840
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：On-line algorithms; Scheduling