.png){kind=icon}
返回
Efficient algorithms for buffer space allocation
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1018988226612.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes efficient algorithms for determining how buffer space should be allocated in a flow line. We analyze two problems: a primal problem, which minimizes total buffer space subject to a production rate constraint; and a dual problem, which maximizes production rate subject to a total buffer space constraint. The dual problem is solved by means of a gradient method, and the primal problem is solved using the dual solution. Numerical results are presented. Profit optimization problems are natural generalizations of the primal and dual problems, and we show how they can be solved using essentially the same algorithms.
Keyword:
KANBAN CONTROL MECHANISMS
PRODUCTION LINE SYSTEMS
STORAGE SPACE
CONCAVITY
PERFORMANCE
CAPACITIES
THROUGHPUT
BLOCKING
QUEUES
DESIGN
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
