.png){kind=icon}
返回
Fast fully polynomial approximation schemes for minimizing completion time variance
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00211-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present fully polynomial approximation schemes (FPASs) for the problem of minimizing completion time variance (CTV) of a set of n jobs on a single machine. The fastest of these schemes runs in time O(n(2)/epsilon) and thus improves on all fully polynomial approximation schemes presented in the literature. (C) 2002 Published by Elsevier Science B.V.
Keyword:
fully polynomial approximation scheme
completion time variance
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏First-line tuberculosis drug resistance patterns and associated risk factors in Germany, 2008-2017.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容