Heuristics for workforce planning with worker differences

摘要: This study considers decisions in workforce management assuming individual workers are inherently different as measured by general cognitive ability (GCA). A mixed integer programming (MIP) model that determines staffing (i.e., hire, cross-train, and fire) order to minimize related costs over multiple periods is described. Solving the MIP for a large problem instance size computationally burdensome. In this paper, two linear (LP) based heuristics solution space partition approach presented reduce computational time. genetic algorithm was also implemented an alternative method obtain better solutions comparison proposed. The were applied realistic manufacturing systems with number of machine groups. Experimental results shows performance LP surprisingly good indicate can solve instances effectively reasonable effort.