Online scheduling of two type parallel jobs on identical machines

被引：0
|
作者：
郭首玮 [1 ]
康丽英 [1 ]
机构：
[1] Department of Mathematics,College of Sciences,Shanghai University
来源：
Advances in Manufacturing | 2010年 / 06期
基金：
中国国家自然科学基金;
关键词：
scheduling; parallel jobs; preemption; online algorithm; competitive analysis;
D O I：
暂无
中图分类号：
O223 [统筹方法];
学科分类号：
070105 ; 1201 ;
摘要：
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using "temporary schedule".
引用
收藏
页码：396 / 399
页数：4
相关论文
共 50 条
12345