.png){kind=icon}
返回
Workload minimization in re-entrant lines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.01.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper is concerned with workload minimization in re-entrant lines with exponential service times and pre-emptive control policies. Using a numerical algorithm called the power series algorithm we obtain nearly optimal policies for systems with up to 8 queues. We also improve considerably the implementation of the power series algorithm. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
dynamic programming
re-entrant lines
power series algorithm
curse of dimensionality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Differences in the mode of regulation of ornithine decarboxylase activity in undifferentiated versus differentiated mouse N‐18 neuroblastoma cells.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAI分享收藏
查看更多内容