人员安排问题的计算机解法  

The Computer Resolution of Personnel Assignment Problem 

作　　者：黄鹤远[1] 凌捷[1] 汤庸[1] 

机构地区：[1]广东工业大学计算机一系

出　　处：《工业工程》1998年第4期55-56,共2页Industrial Engineering Journal

基　　金：广东省自然科学基金

摘　　要：考虑如下人员安排问题：欲分派ｎ个人去做ｎ项工作，要求每个人只做一项工作，求人员安排方案使总效益最大，给出了该问题的计算机解法及算例。Considering of a sort of personnel assignment problem:there are n persons who are to be assigned to do n pieces jobs and each person only does one piece of job.How do we assign the persons to do the jobs in order to gain the maximum benefit? A dynamic programming model and a procedure relevant of the problem is brought forward.

关 键 词：人员安排问题 动态规划 计算机解法 

分 类 号：F406.15[经济管理—产业经济]