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.

Key words: assignment problem, multi-objective, the shortest duration, matrix network, vector-sign algorithm

摘要： 研究每个人承担的工作数不受限制,但每项工作只能由一人承担的情况下,如何给每个人指派工作,才能使完成所有工作的工期最短,并且在此前提下,使完成所有工作的总用时最少.针对这种多目标非确定型指派问题,本文给出了一种向量标记算法,这种算法不但使用方便,而且有很好的运算效率。

关键词: 指派问题, 双层目标, 最短工期, 矩阵网络, 标号算法