一类排序问题的通用模型与最优解

A Generalized Model and Algorithm on a Class Job Scheduling Problem of Multi processors

讨论把ｎ个零件安排给ｍ台机床加工的一类排序问题。在建立了该问题的通用数学模型基础之上，巧妙地把这个排序问题的求解问题转化为指派问题的求解问题，为该排序问题找到了一个理想的通用求解方法。

In this paper, a problem of scheduling multi processors is considered for minimizing total flow time. A generalized model is presented to eliminate the limitation of previous model which only suitable m identical, parallel processor.The scheduling problem above is ingeniously reduced to an assignment problem which can be easily solved by a famous method: Hungary algorithm. Finally, an illustrate example is presented too.