An Analysis of Aggregation Algorithm of Performance Ratio for MAFS Machine Scheduling Problem

摘要：

The MAFS schedule problem has been proved to be NP-complete and no good algorithm is set already. This paper presents a heuristic algorithm Aggregation algorithm and shows the worse-case per formance bound of it is (2m - 1)/m which is illustrated to be achievable for the algorithm.

作者: Lu Xuhua Pan Kailing

作者单位: College of Science Wuhan University of Science and Technology Wuhan, China, 430081 College of Management Wuhan University of Science and Technology Wuhan, China, 430081

会议类型: 国际会议

会议名称: 第三届国际脉冲动力系统及应用学术会议

会议地点: 青岛

会议语种:英文

在线出版日期: 2006-07-21（万方平台首次上网日期，不代表论文的发表时间）