Scheduling problems on two sets of identical machines

被引：21

作者：

Imreh, C ^{[1
]}

机构：

[1] Univ Szeged, Szeged, Hungary

来源：

COMPUTING | 2003年 / 70卷 / 04期

关键词：

scheduling; online algorithms; approximation scheme;

D O I：

10.1007/s00607-003-0011-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we investigate the following scheduling problem: We have two sets of identical machines, the jobs have two processing times one for each set of machines. We consider two different objective functions, in the first model the goal is to minimize the maximum of the makespans on the sets, in the second model we minimize the sum of the makespans. We consider the online, semi online and offline versions of these problems.

引用

页码：277 / 294

页数：18

共 13 条

[1] On-line routing of virtual circuits with applications to load balancing and machine scheduling [J].