摘要
Abstract
To study under the conditions of the number of each person ’ s jobs is unlimited , but every job is com-pleted 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分类
数理科学
