首页|Online scheduling of two type parallel jobs on identical machines

Online scheduling of two type parallel jobs on identical machines

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
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".

schedulingparallel jobspreemptiononline algorithmcompetitive analysis

GUO Shou-wei、KANG Li-ying

展开 >

Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China

国家自然科学基金Shanghai Leading Academic Discipline ProjectInnovation Foundation of Shanghai University

10971131S30104SHUCX091077

2010

10.1007/s11741-010-0666-2

上海大学学报(英文版)
上海大学

上海大学学报(英文版)

影响因子：0.196
ISSN：1007-6417
年,卷(期)：2010.14(6)
  • 11