.png){kind=icon}
返回
Single-machine group scheduling problems with deterioration consideration
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.09.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job deterioration is relatively unexplored in the context of group technology. In this paper, we consider deterioration in the framework of minimizing the makespan and the total completion time in single-machine group scheduling problems. We show that these problems remain polynomially solvable when deterioration is considered. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
group technology
single machine
deteriorating jobs
makespan
total completion time
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容