ABSTRACT
We consider a manpower planning problem (MPP) over a long planning horizon. Dynamic demands for manpower must be satisfied by allocating enough number of employees, under the objective to minimize the overall cost including salary, recruitment cost, and dismissal cost. We first formulate the problem as a multi-period decision model. We then reveal several properties of the optimal solution and develop an improved dynamic programming algorithm with polynomial computational complexity.
