计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (3): 175-175.
• 数据库与信息处理 • 上一篇 下一篇
张建伟 张保威 郭云飞
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
Received:
Revised:
Online:
Published:
摘要: 探讨了分批排序问题,分析了极小化加权总完工时间问题 的复杂性,证明了此问题的NP-完备性,并对一类特定问题进行了研究,给出了解决问题的近似算法,证明了其可行性,进而对算法的性能进行了分析,结果表明算法有效的降低了计算复杂度。
关键词: 分批排序, 复杂度, 近似算法, NP完备性, 性能分析
Abstract: The problem of batch scheduling was discussed especially the problem of minimizing the total weighted completed time, namely problems . Besides the complexity of it was analyzed and the NP-completeness was proved. Then this paper focused on a class of special case of the problem and proposed an approximated algorithm to solve the problem. The proof showed that it was feasible and its capability was improved.
Key words: batch scheduling, complexity, approximated algorithm, NP-completeness, capability analysis
张建伟 张保威 郭云飞. 一类分批排序问题的复杂性分析及近似算法[J]. 计算机工程与应用, 2007, 43(3): 175-175.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I3/175