.png){kind=icon}
返回
Safe scheduling: Setting due dates in single-machine problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.02.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider single-machine stochastic scheduling models with due dates as decisions. In addition to showing how to satisfy given service-level requirements, we examine variations of a model in which the tightness of due-dates conflicts with the desire to minimize tardiness. We show that a general form of the trade-off includes the stochastic E/T model and gives rise to a challenging scheduling problem. We present heuristic solution methods based on static and dynamic sorting procedures. Our computational evidence identifies a static heuristic that routinely produces good solutions and a dynamic rule that is nearly always optimal. The dynamic sorting procedure is also asymptotically optimal, meaning that it can be recommended for problems of any size. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Stochastic scheduling
Heuristics
Due-date setting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs具有提前和迟到成本的随机单机问题中的排序和到期日确定
PREAI
分享收藏 没有更多内容
没有更多内容