.png){kind=icon}
返回
Single machine scheduling with a variable common due date and resource-dependent processing times
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(02)00066-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of scheduling n jobs with a variable common due date on a single machine is studied. It is assumed that the job processing times are non-increasing linear functions of an equal amount of a resource allocated to the jobs. The due date and resource values can be continuous or discrete. The objective is to minimize a linear combination of scheduling, due date assignment and resource consumption costs. The resource consumption cost function may be non-monotonous. Algorithms with O(n(2) log n) running times are presented for scheduling costs involving earliness/tardiness and number of tardy jobs. Computational experiments show that the algorithms can solve problems with n = 5, 000 in less than a minute on a standard PC.
Keyword:
single machine scheduling
common due date assignment
controllable processing times
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
Due-date assignment and single machine scheduling with compressible processing times具有可压缩处理时间的到期日分配和单机调度
PREAI
分享收藏
查看更多内容