.png){kind=icon}
返回
Setting due dates in a stochastic single machine environment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2004.11.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A set of n jobs with statistically independent random processing times has to be processed on a single machine without idling between jobs and without preemption. It is required to set due dates and promise them to customers. During the production stage, earliness and tardiness against the promised due dates will be penalized. The goal is to minimize the total expected penalties. We consider two due date setting procedures with optimum customer service level, and an O(n log n) time complexity. We show that one is asymptotically optimal but the other is not. Both heuristics include safety time and the sequence remains the same regardless of disruptions, so the result is robust. For the normal distribution we provide sufficient optimality conditions, precedence relationships that the optimal sequence must obey, and tight bounds. (c) 2004 Elsevier Ltd. All rights reserved.
Keyword:
stochastic scheduling
due-dates
customer service
robust scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
Pulmonary Hypertensive Crisis During General Anesthesia in a 3-Year-Old Autistic Boy With Undiagnosed Scurvy, Undergoing Cardiac Catheterization: A Case Report全身麻醉期间发生肺动脉高压危象：1例进行心脏导管检查的3岁自闭症男孩，其患有未诊断的坏血病：病例报告
PREAI
分享收藏Third-order exceptional point and successive switching among three states in an optical microcavity光学微腔中三阶异常点和三个状态之间的连续切换
OAAI
OAAI分享收藏
查看更多内容