| 人数少于任务数的全指派问题的迭代算法 |
| |
| 引用本文： | 郭强.人数少于任务数的全指派问题的迭代算法[J].计算机工程与应用,2007,43(24):91-93. |
| |
| 作者姓名： | 郭强 |
| |
| 作者单位： | 西北工业大学,理学院,应用数学系,西安,710072 |
| |
| 摘 要： | 针对人数少于任务数的情况,按每人至少承担一项任务,至多承担L项任务,但每项任务只允许一人承担的指派原则,给出了一种求解这种指派问题的迭代算法,该算法操作简便、易于用计算机运行。构建该算法的方法,用于某些其它指派问题,可以使相应的算法更加便捷。
|
| 关 键 词： | 指配问题 数学模型 网络图 Floyd算法 |
| 文章编号： | 1002-8331（2007）24-0091-03 |
| 修稿时间： | 2006-11 |
Iterative algorithm of total assignment problem on persons less than jobs |
| |
| GUO qiang.Iterative algorithm of total assignment problem on persons less than jobs[J].Computer Engineering and Applications,2007,43(24):91-93. |
| |
| Authors: | GUO qiang |
| |
| Affiliation: | Department of Applied Mathematics，School of Science，Northwestern Polytechnical University，Xi’an 710072，China |
| |
| Abstract: | 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. |
| |
| Keywords: | assignment problem mathematical model network chart Floyd algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
