.png){kind=icon}
返回
Multiple bottleneck assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00392-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the multiple bottleneck assignment problem which subsumes the well known min-sum and bottleneck assignment problems. The problem arises in the context of flexible manufacturing systems, where the objective is to maximize the throughput of a production system with several how shops, running in parallel, to produce a product. The problem is known to be strongly NP-hard. We propose a new algorithm for obtaining sharp lower bounds to the optimal objective value. Computational experiments are conducted to show the improvement over existing methods. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
integer programming
network programming
combinatorial analysis
computational analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Optimization of deproteinization process by response surface method and the neuroprotective activity study of Rhizoma menispermi crude polysaccharide响应面法优化去蛋白化工艺及菝葜粗多糖的神经保护活性研究.png)
IF0
PREAI
分享收藏
没有更多内容
没有更多内容