人数少于任务数的全指派问题的迭代算法  

Iterative algorithm of total assignment problem on persons less than jobs

作　　者：郭强[1] 

机构地区：[1]西北工业大学理学院应用数学系,西安710072

出　　处：《计算机工程与应用》2007年第24期91-93,103,共4页Computer Engineering and Applications

摘　　要：针对人数少于任务数的情况,按每人至少承担一项任务,至多承担L项任务,但每项任务只允许一人承担的指派原则,给出了一种求解这种指派问题的迭代算法,该算法操作简便、易于用计算机运行。构建该算法的方法,用于某些其它指派问题,可以使相应的算法更加便捷。Aim at the case of persons less than jobs,an iterative algorithm of the assignment problem that every person does a job at least,does L jobs at most,but each job is done by one person is given in this paper.The algorithm operates simple,the easy conversion becomes the calculator procedure.So is it when set up the method the algorithm,used for some other assignment problems.

关 键 词：指配问题数学模型网络图Floyd算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]