摘要
对从m个人中派出k(0<k≤min{m,n})个人去完成n项任务中的k项任务,使总效率最高这类指派问题给出了新算法,通过对这类指派问题引入了反点的概念,讨论了反点所具有的一些性质并证明了相关结论,利用这些结论找到了通过增加反点来解决此类指派问题的反点算法.
In this paper, we propose a new algorithm on a special assignment problem in which the real assigned jobs are less than or equal to both the total persons and the total jobs. To this special assingment problem we pose the concept of reserve point, discussed the character of reserve point and accessed to relevant conclusion. A new method to solve this special assignment problem is given through increasing reserve points finally.
出处
《运筹学学报》
CSCD
2011年第3期124-128,共5页
Operations Research Transactions
关键词
指派问题
反点
最优解
Assignment problem, reverse point, optimal solution
