Single-machine scheduling with a time-dependent deterioration

被引:39
|
作者
Wang, Ji-Bo [1 ]
Wang, Li-Yan [1 ,2 ]
Wang, Dan [1 ]
Wang, Xiao-Yuan [1 ]
机构
[1] Shenyang Inst Aeronaut Engn, Sch Sci, Shenyang 110136, Peoples R China
[2] Dalian Univ Technol, Dept Appl Math, Dalian 116024, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Single machine; Time-dependent; Deteriorating jobs; COMPLETION-TIME;
D O I
10.1007/s00170-008-1760-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The paper deals with the single-machine scheduling problems with a time-dependent deterioration. By time-dependent deterioration, we mean that the processing time of a job is defined by an increasing function of total normal processing time of jobs in front of it in the sequence. We show that, even with the introduction of time-dependent deterioration to job processing times, the single-machine makespan minimization problem remains polynomially solvable. We also show that an optimal schedule of the total completion time minimization problem is V-shaped with respect to normal job processing times.
引用
收藏
页码:805 / 809
页数:5
相关论文
共 50 条