.png){kind=icon}
返回
Stochastic single machine scheduling with random common due date
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2012.671589.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies the single machine scheduling problem for minimising the expected total weighted deviations of completion times from random common due date. Jobs have exponentially distributed processing times and the common due date is a generalised Erlang distribution. The optimal schedules are shown to be boolean AND-shaped. Moreover, we give the optimal schedules when the machine is subject to stochastic breakdowns with independent and exponentially distributed uptimes and downtimes.
Keyword:
scheduling
common due date
early-tardy penalty
stochastic breakdowns
boolean AND-shaped
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
Wheat Bread Fortification by Grape Pomace Powder: Nutritional, Technological, Antioxidant, and Sensory Properties.png)
Foods
OAAI
FoodsIF0
OAAI分享收藏
查看更多内容