A note on scheduling on a single processor with speed dependent on a number of executed jobs

被引：68

作者：

Gawiejnowicz, S

机构：

[1] Adam Mickiewicz University, Fac. of Math. and Computer Science, 60-769 Poznań

来源：

INFORMATION PROCESSING LETTERS | 1996年 / 57卷 / 06期

关键词：

algorithms; single processor; Makespan scheduling;

D O I：

10.1016/0020-0190(96)00021-X

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this note the makespan scheduling problem on a single processor is considered. The speed of a processor depends on number of already processed jobs and is described by a function. Several polynomial-time algorithms for finding an optimal schedule are given.

引用

页码：297 / 300

页数：4

共 10 条

[1]

Blazewicz J., 1993, SCHEDULING COMPUTER

[2] SCHEDULING DETERIORATING JOBS ON A SINGLE PROCESSOR [J].