LP model for periodic recruitment and retrenchment of manpower in a new organization

Abstract

In this paper we have examined the manpower planning problem in which the maximum total number of employees to be recruited when the organization is in full operation is known. The manpower system has no initial employees at period n=0. The system also allows a periodic recruitment and retrenchment for a finite time interval. In addition to the usual constraints in linear programming (LP) formulation, we included the periodic overstaffing employees in the LP formulation, which by a theorem reduced the LP problem to a sparser LP problem. The resulting sparse LP problem has the advantage of less computational time when solving either manually or by computer.