摘要
C-A指派问题是实际分配任务数不仅小于总任务数,而且小于总人数,并且规定一人一事和一事一人,是一类非标准形式的指派问题.鉴于用匈牙利法求解这类非标准形式C-A指派问题的计算复杂性,给出一种新的算法,该算法首先用差值法找出可行解,然后通过行、列调整找到最优解.
In the light of the complicated calculating situation of the Hungary algorithm solving C-A assignment problem, a new and simple method is put forward. First it finds out the feasible solution by difference value method and then optimal solution can be found through the row and column revisions. Compared with the present calculating method, the new method is easier and more feasible.
出处
《襄樊学院学报》
2011年第8期21-23,54,共4页
Journal of Xiangfan University
基金
襄樊学院科学研究资助项目(2010YA014)
关键词
C-A指派问题
匈牙利法
差值法
C-A assignment problem
Hungary algorithm
Difference value method
