.png){kind=icon}
返回
An improved earliness-tardiness timing algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2005.11.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Earliness-tardiness criteria with distinct due dates usually induce NP-complete problems. Researchers have focused on particular cases like the timing problem, which is to look for the optimal schedule when the jobs sequence is already known. These timing algorithms are very useful since they can be used in more complex procedures. In the first part of this paper we provide the most efficient and fairly general algorithm to solve the one-machine timing problem. It is then adapted to a permutation flow shop problem. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
scheduling
earliness-tardiness
timing algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
A Retrospective Observational Single-Centre Study on the Burden of Immune Thrombocytopenia (ITP).png)
Onkologie
OAAI
OnkologieIF0
OAAI分享收藏Overexpression of Gremlin-1 in Patients with Loeys-Dietz Syndrome: Implications on Pathophysiology and Early Disease DetectionPLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏分享收藏Radiation induced cytochrome c release causes loss of rat colonic fluid absorption by damage to crypts and pericryptal myofibroblastsGutOAAI
GutIF0
OAAI分享收藏
查看更多内容