摘要
考虑如下人员安排问题：欲分派ｎ个人去做ｎ项工作，要求每个人只做一项工作，求人员安排方案使总效益最大，给出了该问题的计算机解法及算例。
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.
出处
《工业工程》
1998年第4期55-56,共2页
Industrial Engineering Journal
基金
广东省自然科学基金
