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"."
而對於人員數多於任務數的指派問題文中給出的求解方法是類匈牙利算法。