.png){kind=icon}
返回
A note on due-date assignment and single machine scheduling with a learning/aging effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2008.10.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the learning/aging effect in an n job single machine scheduling problem with common due date. The objective is to determine the optimal common due date and the optimal sequence of jobs that minimizes a cost function in the presence of learning/aging effect. The cost function depends on the individual job earliness and tardiness values: i.e., Sigma(n)(j=1) {E([j]) + T([j])}. This is a well-known problem when the learning/aging effect is not considered and it is shown in earlier studies that there are more than one optimal sequence and optimal common due dates. It is shown in earlier studies that there are 2(r-1) optimal sequences to this problem if n is odd, and 2(r) optimal sequences if n is even. The value of r is (n + 1)/2 if n is odd, and the value of r is n/2 if n is even. In this paper, we derive two bounds B(alpha) and B(alpha)* for the learning index alpha. We show that when B(alpha) < alpha < 0, then the optimal sequence is unique and provide an O(n log n) algorithm to obtain this unique optimal sequence and the optimal common due date. We also show that when alpha A(alpha)* the optimal sequence is obtained by arranging the jobs in LPT order. We also present a numerical example for ease of understanding. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Single-machine
Learning effect
Due-date assignment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏Cdc42 is required for chondrogenesis and interdigital programmed cell death during limb development
OAAI
OAAI分享收藏Due-date assignment and single machine scheduling with compressible processing times具有可压缩处理时间的到期日分配和单机调度
PREAI
分享收藏
查看更多内容