OPTIMAL TRAINING POLICY FOR PROMOTION - STOCHASTIC MODELS OF MANPOWER SYSTEMS

• V.S.S. Yadavalli Department of Industrial and Systems Engineering, University of Pretoria
• R. Natarajan Department of Mathematics, Presidency College (Autonomous), Chennai, 600005, India
• S. Udayabhaskaran Department of Mathematics, Presidency College (Autonomous), Chennai, 600005, India

DOI:

https://doi.org/10.7166/13-1-315

Abstract

In this paper, the optimal planning of manpower training programmes in a manpower system with two grades is discussed. The planning of manpower training within a given organization involves a trade-off between training costs and expected return. These planning problems are examined through models that reflect the random nature of manpower movement in two grades. To be specific, the system consists of two grades, grade 1 and grade 2. Any number of persons in grade 2 can be sent for training and after the completion of training, they will stay in grade 2 and will be given promotion as and when vacancies arise in grade 1. Vacancies arise in grade 1 only by wastage. A person in grade 1 can leave the system with probability p. Vacancies are filled with persons in grade 2 who have completed the training. It is assumed that there is a perfect passing rate and that the sizes of both grades are fixed. Assuming that the planning horizon is finite and is T, the underlying stochastic process is identified as a finite state Markov chain and using dynamic programming, a policy is evolved to determine how many persons should be sent for training at any time k so as to minimize the total expected cost for the entire planning period T.