Minimizing the total weighted completion time of deteriorating jobs

被引：88

作者：

Bachman, A

Janiak, A

Kovalyov, MY

机构：

[1] Wroclaw Univ Technol, Inst Engn Cybernet, PL-50372 Wroclaw, Poland

[2] Natl Acad Sci Belarus, Inst Engn Cybernet, Minsk 220012, BELARUS

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 81卷 / 02期

关键词：

scheduling; computational complexity; start time dependent processing time; deteriorating job; single machine;

D O I：

10.1016/S0020-0190(01)00196-X

中图分类号：

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

学科分类号：

0812 ;

摘要：

The paper deals with a single machine problem of scheduling jobs with start tune dependent processing tithes to minimize the total weighted completion time. The computational complexity of this problem was unknown for ten years. We prove that the problem is NP-hard. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：81 / 84

页数：4

共 9 条

[1] Scheduling with time dependent processing times: Review and extensions [J].