摘要
在人员招聘工作中,通常有招聘总人数和各部门最低录取人数要求等限制。针对给定的限制条件,本文给出了一类人员招聘问题的数学模型。考虑招聘过程中固定指标为0和机动指标为0的特殊情形,分别给出了相应模型的贪婪算法和匈牙利指派算法,在此基础上给出了求解该问题的一种基于指派问题的一般算法,并对相应的算法的最优性给出了证明,算法的复杂度仅为O(m3)。以公务员招聘的实际算例验证,模型能合理地满足招聘单位的实际需求。
In the process of the staff employment, the strategy is restricted by the total amount and staff number of some branches. For the restriction, the model of the staff employment problem is put forward. The greedy algorithm is given for the instance that the fixation scalar is zero, and the Hungarian appointment algowithm for the instance that the flexibility scalar is zero. And the normal algorithm on the basis of appointement algorithm and greedy algorithm is educed. The optima of these algorithms are proved. The complexities of these algorithms just are O（m^3）.
出处
《运筹与管理》
CSCD
2007年第4期149-152,共4页
Operations Research and Management Science
关键词
人员招聘
指派问题
匈牙利算法
贪婪算法
staff employment
appointement problem
Hungarian algorithm
greedy algorithm
