An analysis of aggregation algorithm of performance ratio for MAFS machine scheduling problem

作者：Lu Xuhua^*; Pan Kailing

来源：Dynamics of Continuous Discrete and Impulsive Systems: Series A - Mathematical Analysis , 2006, 13: 1077-1079.

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 performance bound of it is (2m -1)/m which is illustrated to be achievable for the algorithm.

• 出版日期2006-12
• 单位武汉科技大学