|
|||||
|
|
| 一类非确定型多目标指派问题及其算法研究 | |
| 引用本文： | 付晓薇,郭强,马芹芹. 一类非确定型多目标指派问题及其算法研究[J]. 运筹与管理, 2013, 22(6): 34-38 |
| 作者姓名： | 付晓薇 郭强 马芹芹 |
| 作者单位： | 西北工业大学 理学院应用数学系,陕西 西安 710129 |
| 摘 要： | 研究每个人承担的工作数不受限制,但每项工作只能由一人承担的情况下,如何给每个人指派工作,才能使完成所有工作的工期最短,并且在此前提下,使完成所有工作的总用时最少.针对这种多目标非确定型指派问题,本文给出了一种向量标记算法,这种算法不但使用方便,而且有很好的运算效率。 |
| 关 键 词： | 指派问题 双层目标 最短工期 矩阵网络 标号算法 |
| 收稿时间： | 2012-07-19 |
A Multiple Objective Uncertainty Assignment Problem and the Study of Its Algorithm |
|
| FU Xiao-wei,GUO Qiang,MA Qin-qin. A Multiple Objective Uncertainty Assignment Problem and the Study of Its Algorithm[J]. Operations Research and Management Science, 2013, 22(6): 34-38 | |
| Authors: | FU Xiao-wei GUO Qiang MA Qin-qin |
| Affiliation: | Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi'an 710129, China |
| Abstract: | To study under the conditions of the number of each person's jobs is unlimited, but every job is completed by only one person, how to allocate existing jobs we can get the shortest duration of all jobs, and in the case of the shortest duration how to allocate these jobs can make the whole completed time least. For the multi-objective and non-deterministic assignment problem, a vector-sign algorithm is proposed , and this algorithm is not only convenient, but also has good computational efficiency. |
| Keywords: | assignment problem multi-objective the shortest duration matrix network vector-sign algorithm |
| 点击此处可从《运筹与管理》浏览原始摘要信息 | |
| 点击此处可从《运筹与管理》下载免费的PDF全文 | |