personnel assignment problem

基本解釋

Vehicle scheduling is a typical NP hard problem involving task assignment, time arrangement, personnel arrangement and route selection.
運(yùn)輸調(diào)度涉及到任務(wù)分配、時(shí)間安排、人員安排以及路線選擇等，是一個(gè)典型的非多項(xiàng)式睏難問題。
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;
標(biāo)準(zhǔn)的指派問題以人員指派爲(wèi)例大都滿足以下三個(gè)前提假設(shè)：人數(shù)等於任務(wù)數(shù)；
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"."
而對(duì)於人員數(shù)多於任務(wù)數(shù)的指派問題文中給出的求解方法是類匈牙利算法。