A 2.28-COMPETITIVE ALGORITHM FOR ONLINE SCHEDULING ON IDENTICAL MACHINES

被引：6
|
作者：
Tao, Jiping [1 ]
Huang, Ronghuan [1 ]
Liu, Tundong [1 ]
机构：
[1] Xiamen Univ, Dept Automat, Xiamen 361005, Peoples R China
来源：
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | 2015年 / 11卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Identical machines scheduling; online algorithms; competitive analysis; instance reduction; AVERAGE COMPLETION-TIME; SINGLE-MACHINE;
D O I：
10.3934/jimo.2015.11.185
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Online scheduling on identical machines is investigated in the setting where jobs arrive over time. The goal is to minimize the total completion time. A waiting strategy based online algorithm is designed and is proved to be 2.28-competitive. The result improves the current best online algorithm from the worse-case prospective.
引用
收藏
页码：185 / 198
页数：14
相关论文
共 50 条
12345