.png){kind=icon}
返回
Two due date assignment problems with position-dependent processing time on a single-machine
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.01.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing the due dates, the total cost of positional weight earliness, and the total cost of the discarded jobs that cannot be completed by their due dates. We conclude that the problems are polynomial time solvable. Significantly enough, after assessing the special case of each problem, this research found out that they can be optimally solved by lower order algorithms. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Common due date
Slack due date
Position-dependent processing time
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
Single machine scheduling and due date assignment with positionally dependent processing times具有位置相关处理时间的单机调度和到期日分配
PREAI
分享收藏A survey of the state-of-the-art of common due date assignment and scheduling research对通用到期日分配和计划研究的最新进展的调查
PREAI
分享收藏
没有更多内容
没有更多内容