A note on single-machine makespan problem with general deteriorating function

被引：0
作者：
Wen-Chiung Lee
Chin-Chia Wu
Han-Chu Liu
机构：
[1] Feng Chia University,Department of Statistics
来源：
The International Journal of Advanced Manufacturing Technology | 2009年 / 40卷
关键词：
Scheduling; Single-machine; Deteriorating jobs; Makespan;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Recently, deteriorating job scheduling problems have received increasing attention. However, the majority of the research assumes that the actual job processing time is a function of its starting time. In this note, we develop a new deterioration model where the actual job processing time is a function of jobs already processed. We show that the single-machine makespan problem remains polynomially solvable under the proposed model.
引用
收藏
页码：1053 / 1056
页数：3
相关论文
共 54 条
[1]  
Gupta JND(1988)Single facility scheduling with nonlinear processing times Comput Ind Eng 14 387-393
[2]  
Gupta SK(1998)Single machine sequencing with linear models of release dates Nav Res Logist 45 99-113
[3]  
Janiak A(1990)Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem Eur J Oper Res 47 56-64
[4]  
Kunnathur AS(1990)Scheduling deteriorating jobs on a single processor Oper Res 38 495-498
[5]  
Gupta SK(1994)Scheduling jobs under simple linear deterioration Comput Oper Res 21 653-659
[6]  
Browne S(1994)Single machine scheduling with start time dependent processing time: Some solvable cases Eur J Oper Res 78 394-403
[7]  
Yechiali U(1995)A note on single-processor scheduling with time-dependent execution times Oper Res Lett 17 127-129
[8]  
Mosheiov G(1998)The complexity of single machine scheduling with release times Inf Process Lett 65 75-79
[9]  
Sundararaghavan PS(2002)Scheduling start time dependent jobs to minimize the total weighted completion time J Oper Res Soc 53 688-693
[10]  
Kunnathur A(2002)Three scheduling problems with deteriorating jobs to minimize the total completion time Inf Process Lett 81 327-333
123456