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.
Highlights
These planning problems are examined through models that reflect the random nature of manpower movement in two grades
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
Optimal planning of training in manpower systems has been studied by several researchers (see Guardabassi (1969), Purkiss (1969), Grinold and Marshall (1977), Vajda (1978), Nakamura and Shingu (1984), Goh et al (1987))
Summary
Optimal planning of training in manpower systems has been studied by several researchers (see Guardabassi (1969), Purkiss (1969), Grinold and Marshall (1977), Vajda (1978), Nakamura and Shingu (1984), Goh et al (1987)). In these papers, the general objective is to minimize the reference cost or maximize the expected return for the planning period. In the paper of Goh et al (1987), the dynamic programming principle of Bellman (1957) is used to obtain the optimum training plan for a single grade organization, in which the random nature of manpower movements are considered due to training and waste. A numerical example is provided in section 5 to illustrate the behaviour of the model
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The South African Journal of Industrial Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
