摘要
经典的 Flow Shop问题是排序理论中一个得到广泛研究的问题 .本文研究的是带服务器的Flow Shop问题 .证明了 F2 ,S∥ Cmax 是强 N P- C的 ,并构造了一个渐近比为 2的近似算法 .此外 。
The classic Flow Shop problem is a widely researched problem. In this paper, the Flow Shop problem with a server was considered. It was proved that this problem is strongly NP\|C. Then an approximate algorithm with worst performance ratio 2 was constructd. And two polynomial solvable cases were also given.
出处
《浙江大学学报(理学版)》
CAS
CSCD
2000年第4期382-387,共6页
Journal of Zhejiang University(Science Edition)
基金
国家重点基础研究专项经费