Single-machine scheduling with precedence constraints and decreasing start-time dependent processing times

被引:7
|
作者
Gao, Wen-Jun [1 ]
Huang, Xue [1 ]
Wang, Ji-Bo [1 ]
机构
[1] Shenyang Inst Aeronaut Engn, Operat Res & Cybernet Inst, Sch Sci, Shenyang 110136, Peoples R China
关键词
Scheduling; Single machine; Time-dependent processing times; Parallel chains; Series-parallel graph; WEIGHTED COMPLETION-TIME; SIMPLE LINEAR DETERIORATION; MAXIMUM LATENESS; PARALLEL MACHINE; RELEASE TIMES; JOBS; COMPLEXITY; MINIMIZE; COSTS; TASKS;
D O I
10.1007/s00170-009-2089-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we consider single-machine scheduling problems with decreasing start-time-dependent processing times, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraint, respectively. It is shown that, for the problems of minimization of the total weighted completion time, polynomial algorithms exist.
引用
收藏
页码:291 / 299
页数:9
相关论文
共 50 条