.png){kind=icon}
返回
A reduction technique for weighted grouping problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00204-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Weighted grouping problems are shown to have an equivalent reduced form, which is often considerably smaller than the original problem. Although the reduction may be small for randomly generated problems, real-life problems often contain non-random properties that greatly increase the effect of reduction. We give an efficient algorithm to build the reduced problem instance, and analyse the expected amount of reduction for certain statistical distributions and real-life data. In addition, we briefly discuss the effect of reduction on traditional solving methods of the grouping problem. The results show clearly the usefulness of problem reduction: it is computationally cheap to apply and may make the reduced problem solvable in a practical time whilst the original one is not. The method is readily applicable to the job grouping problem of printed circuit board (PCB) printing industry. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
flexible manufacturing systems
combinatorial optimization
job grouping
electronics assembly
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Gray scale echography of the lung and pleural space.Current applications of oncologic interest.png)
Cancer
OAAI
CancerIF0
OAAI分享收藏The construction of a high-density consensus genetic map for soybean based on SNP markers derived from genotyping-by-sequencingGenome
OAAI
GenomeIF0
OAAI分享收藏
查看更多内容