Multi-objective stochastic programming to solve manpower allocation problem


DOI: 10.1007/s00170-012-4159-3

Cite this article as:
Ekhtiari, M. & Ghoseiri, K. Int J Adv Manuf Technol (2013) 65: 183. doi:10.1007/s00170-012-4159-3


Effective manpower allocation is among the most vital and complicated decisions for most companies on account of imprecise nature of input information of the problem. This paper presents a novel combination of the chance-constrained programming and the global criterion model for manpower allocation problem that is called chance-constrained global criterion. The proposed model is a deterministic equivalent for the multi-objective stochastic problem of manpower allocation. To illustrate the model, a tri-objective stochastic manpower allocation case problem for determining optimal number of manpower in a job-shop manufacturing system is formulated and solved, and then the competitive advantages of the model are discussed. To have a better judgment on the validity and performance efficiency of the model, 20 different problems are generated and solved. The results show that increasing the size of problem do not have much effect on the number of iterations required for finding the optimal solution, and this model decreases complicacy in modeling the problem.


Chance-constrained programming approach Global criterion Multi-objective stochastic programming Manpower allocation problem 

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Department of Industrial & Mechanical EngineeringIslamic Azad University, Qazvin BranchQazvinIran
  2. 2.Department of Civil and Environmental EngineeringUniversity of MarylandCollege ParkUSA

Personalised recommendations