.png){kind=icon}
返回
Single machine scheduling with time-dependent deterioration and exponential learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2009.08.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we consider the single machine scheduling problems with time-dependent deterioration and exponential learning effect, i.e., the actual processing time of a job depends not only on the processing times of the jobs already processed but also on its scheduled position. We consider the following objective functions: the makespan, the sum of the delta th (delta >= 0) power of job completion times, the total weighted completion time and the maximum lateness. We show that the makespan minimization problem, the sum of the delta th power of job completion times minimization problem can be solved by the smallest (normal) processing time first (SPT) rule, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions. (C) 2009 Published by Elsevier Ltd.
Keyword:
Scheduling
Single machine
Learning effect
Deteriorating jobs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
Cdc42 is required for chondrogenesis and interdigital programmed cell death during limb development
OAAI
OAAI分享收藏Thought for food: Clinical evidence for the dietary prevention strategy in cardiovascular disease
PREAI
分享收藏
查看更多内容