Skip to main content
Log in

Optimal manpower recruitment by stochastic programming in graded manpower systems

  • Research Article
  • Published:
International Journal of Systems Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

Human resource is one of the most effective resources in the development of any organization or a Nation. Optimal utilization of manpower is a pivotal challenge to a manager of a dynamic management system. Achieving the objectives by meeting the constraints on various feasibilities is the core problem before statisticians, model developers and OR scientists. In this paper we develop a model with Stochastic Programming Problem of manpower recruitment for an organization where the graded manpower system is observed. The averages, variance of number of employees in initial and final grades before leaving/resigning organization are computed by a suitable bivariate probability mass function. The costs like setup cost, recruitment cost, salaries, Cost of Training, Promotion Costs etc., are considered while developing a model. Sensitivity analysis was also carried out and observed the model behaviour. This model is a suitable tool to serve the decision maker for making optimal decisions on Recruitment policies for determining the optimal recruitment cost, to decide number of employees to be recruited through various grades, to estimate the number of employees for Promotion and to Retirement etc.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chattopadhyay et al (2007) A stochastic manpower planning model under varying class sizes. Ann Oper Res 155:41–49

    Article  MATH  MathSciNet  Google Scholar 

  • Dill WR, Gawer DP, Weber WL (1966) Models and modeling for manpower planning. Manag Sci 13(4):B142–B167

    Article  Google Scholar 

  • Gary L et al (1975) A model for manpower management. Manag Sci 21(12)

  • Ginsberg RB (1971) Semi-Markov process and mobility. J Math Sociol 1:233–262

    Article  MATH  MathSciNet  Google Scholar 

  • Glen JJ (1977) Length of service distributions in markov manpower models. Oper Res Q 28:975–982

    Article  MATH  Google Scholar 

  • Jeeva M et al (2004) An application of stochastic programming with Weibull distribution–cluster based optimum allocation of recruitment in manpower planning. Stoch Anal Appl 22(3):801–812

    Article  MATH  MathSciNet  Google Scholar 

  • Jewelt RJ (1967) A minimum risk manpower schedule technique. Manag Sci 13(10):B578–B592

    Google Scholar 

  • Kareem B, Aderoba AA (2008) Linear programming based effective maintenance and manpower planning strategy: a case study. J Comput Internet Manag 16(2):26–34

    Google Scholar 

  • Srinivasa Rao K, Srinivasa Rao V, Vivenkanada Murty M (2006) On two graded manpower planning model. Opsearch 43(3):225–237

    MATH  Google Scholar 

  • Taiwo AS (2007) Determination of the optimal manpower size using linear programming model. Res J Bus Manag 1(1):30–36

    Article  Google Scholar 

  • Vajda S (1985) The use of linear programming in manpower planning; Homenaje Al Profesor Sixto Rios Trabajos De Estadistica De Investigacion Operativa 36(3):301–311

  • Yadavalli VSS, Natarajan R (2001) A semi-Markov modelo f manpower system. Stoch Anal Appl 19(6):1077–1086

    Article  MATH  MathSciNet  Google Scholar 

  • Yadavalli VSS, Natarajan R, Udayabhaskaran S (2002) Time dependent behaviour of Stochastic models of manpower system—impact of pressure on promotion. Stoch Anal Appl 20(4):863–882

    Article  MATH  MathSciNet  Google Scholar 

  • Yadavalli VSS, Setlhare K, Mishra SS, Rajalakshmi R (2006) An analysis of an optimal promotion policy for a manpower system using a queuing approach. Manag Dyn. http://findarticles.com/p/articles/mi_qa5465/is_200604/ai_n21402995/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. R. S. Reddy.

Appendices

Appendix 1

See Table 1.

Table 1 The decision parameters Lambda and Delta; the optimum cost for various values of alpha, beta, gamma, N0, M0

Appendix 2

2.1 Inputs of manpower requirements

See Figs. 1 and 2.

Fig. 1
figure 1

For the values of s1 = 15000; s2 = 25000; S = 7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; M0 = 110, α = 5; β = 10; γ = 25

Fig. 2
figure 2

For the Values of s1 = 15000; s2 = 25000; S = 7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; α = 5; β = 10; γ = 25

2.2 Inputs of decision parameters

See Figs. 3, 4 and 5.

Fig. 3
figure 3

For the Values of s1 = 15000; s2 = 25000; S =7000000; p1 = 7000; p2 =10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; M0 = 110, β = 10; γ = 25

Fig. 4
figure 4

For the Values of s1 = 15000; s2 =25000; S =7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; M0 = 110, α = 5; γ = 25

Fig. 5
figure 5

For the Values of s1 = 15000; s2 =25000; S =7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; M0 = 110, α = 5; β = 10

2.3 Inputs of manpower requirements

See Figs. 6 and 7.

Fig. 6
figure 6

For the Values of s1 = 15000; s2 =25000; S =7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; M0 = 110, α = 5; β = 10; γ = 25

Fig. 7
figure 7

For the Values of s1 = 15000; s2 =25000; S =7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; α = 5; β = 10; γ = 25

2.4 Inputs of decision parameters

See Figs. 8, 9 and 10.

Fig. 8
figure 8

For the Values of s1 = 15000; s2 =25000; S =7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; β = 10; γ = 25

Fig. 9
figure 9

For the Values of s1 = 15000; s2 =25000; S =7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; α = 5; γ = 25

Fig. 10
figure 10

For the Values of s1 = 15000; s2 =25000; S =7000000; p1 = 7000; p2 = 10000; P = 300000; r1 = 500; r2 = 800; R = 100000; N0 = 150; α = 5; β = 10

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rao, P.T., Reddy, P.R.S. & Suhasini, A.V.S. Optimal manpower recruitment by stochastic programming in graded manpower systems. Int J Syst Assur Eng Manag 1, 178–185 (2010). https://doi.org/10.1007/s13198-010-0016-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-010-0016-7

Keywords

Navigation