Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (3): 175-175.

• 数据库与信息处理 • Previous Articles     Next Articles

Complexity Analysis of A Class of Problems on Batch Scheduling and Its Approximated Algorithm

  

  • Received:2006-02-10 Revised:1900-01-01 Online:2007-01-21 Published:2007-01-21

一类分批排序问题的复杂性分析及近似算法

张建伟 张保威 郭云飞   

  1. 郑州轻工业学院 郑州轻工业学院 国家数字交换系统工程技术研究中心
  • 通讯作者: 张建伟

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

摘要: 探讨了分批排序问题,分析了极小化加权总完工时间问题 的复杂性,证明了此问题的NP-完备性,并对一类特定问题进行了研究,给出了解决问题的近似算法,证明了其可行性,进而对算法的性能进行了分析,结果表明算法有效的降低了计算复杂度。

关键词: 分批排序, 复杂度, 近似算法, NP完备性, 性能分析