摘要
本文提出人数与任务数不相等的指派问题应当视为一个多目标决策问题,首先要求指派给各人的任务数目两两之间相差不能超过1,其次要求所需总时间最少;并且给出了该问题的求解方法。
We have studied an assignment problem with which the quantities of workers and projects are diffe-(rent.) Every project is assigned to a worker. We put forward that this problem should be considered as a pro-(blem) of multiple objective decision making. The difference of each pair of workers' project quantities should be no more than 1. This is the first objective. Certainly, the cost must be minimal. It is the second objective. We have given a method to solve this problem in this paper.
出处
《运筹与管理》
CSCD
2005年第2期64-66,共3页
Operations Research and Management Science
关键词
运筹学
指派问题
多目标决策
匈牙利算法
解矩阵
operational research
assignment problem
multiple objective decision making
Hungarian algorithm
solution matrix
