Worst‐case performance of approximation algorithms for tool management problems
研究了柔性制造系统中刀具管理问题的多项式时间近似算法，通过最坏情况分析发现这些算法性能较差，并证明了该类问题与最大团问题、集合覆盖问题等经典组合问题的关联及不可近似性。
Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems, Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to be among the more fundamental ones of these problems. Most tool management problems are hard to solve, so that numerous approximate solution techniques have been proposed to tackle them. In this paper, we investigate the quality of such algorithms by means of worst-case analysis. We consider several polynomial-time approximation algorithms described in the literature, and we show that all these algorithms exhibit rather poor worst-case behavior. We also study the complexity of solving tool management problems approximately. In this respect, we investigate the interrelationships among tool management problems, as well as their relationships with other well-known combinatorial problems such as the maximum clique problem or the set covering problem, and we prove several negative results on the approximability of various tool management problems. (C) 1999 John Wiley & Sons, Inc.