Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

被引：74

作者：

Wu, CC ^{[1
]}

Lee, WC ^{[1
]}

机构：

[1] Feng Chia Univ, Dept Stat, Taichung 407, Taiwan

来源：

INFORMATION PROCESSING LETTERS | 2003年 / 87卷 / 02期

关键词：

scheduling; single machine; makespan; deteriorating job; availability constraint;

D O I：

10.1016/S0020-0190(03)00262-X

中图分类号：

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

学科分类号：

0812 ;

摘要：

The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper. By a deteriorating job we mean that the processing time for the job is a function of its starting time. Even with the introduction of the availability to a facility, the linear deteriorating model can be solved using the 0-1 integer programming technique if the actual job processing time is proportional to the starting time. (C) 2003 Elsevier Science B.V. All rights reserved.

引用

页码：89 / 93

页数：5

共 14 条

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