.png){kind=icon}
返回
Setting optimal due dates in a basic safe-scheduling model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.07.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We examine a basic stochastic sequencing model with due dates as decisions. The objective is to make due dates as tight as possible while meeting service level constraints. We develop an optimizing procedure using branch and bound, and we evaluate the performance of heuristic procedures as well. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Safe scheduling
Stochastic sequencing
Due-date setting
Service levels
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Wheat Bread Fortification by Grape Pomace Powder: Nutritional, Technological, Antioxidant, and Sensory Properties.png)
Foods
OAAI
FoodsIF0
OAAI分享收藏Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation
PREAI
分享收藏Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs具有提前和迟到成本的随机单机问题中的排序和到期日确定
PREAI
分享收藏
查看更多内容