SCHEDULING JOBS WITH VARYING PROCESSING TIMES

被引：23

作者：

GAWIEJNOWICZ, S

PANKOWSKA, L

机构：

[1] Faculty of Mathematics and Computer Science, Adam Mickiewicz University, 60-769 Poznań

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 54卷 / 03期

关键词：

ALGORITHMS; PARALLEL PROCESSING;

D O I：

10.1016/0020-0190(95)00009-2

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper the makespan scheduling problem on one machine and C-max criterion is considered. Job processing times are described by increasing linear functions depending on the starting times of the jobs. Two polynomial-time algorithms for finding an optimal schedule are given.

引用

页码：175 / 178

页数：4