personnel assignment problem

基本解释

Vehicle scheduling is a typical NP hard problem involving task assignment, time arrangement, personnel arrangement and route selection.
运输调度涉及到任务分配、时间安排、人员安排以及路线选择等，是一个典型的非多项式困难问题。
Standard assignment problems taking the personnel assignment problem for example, mostly satis-fy the following three assumptions, the number of people is equal to the number of the task;
标准的指派问题以人员指派为例大都满足以下三个前提假设：人数等于任务数；
Based on this method and Hungarian algorithm, the article offers a solution to the multi-objectives decision problem---personnel with ability restriction and personnel fewer than assignment"."
而对于人员数多于任务数的指派问题文中给出的求解方法是类匈牙利算法。