A control rule for planning promotion in a Nigerian university setting

Abstract

Abstract. This paper examines the attainability problem in a graded manpower system, where the objective is to maximise the total throughput. The problem is modelled as a linear programming problem (LPP) and the evolution of structures in the system is described using the Markov chain model. The decision variables are the promotion rates. Results from the LPP provide a guide to the administrative authority of the system on how promotion and retrenchment should be implemented. The utility of the model is demonstrated using a university setting in Nigeria.

On the Alternative Structures for a Three-Grade Markov Manpower System

“…This study considers a three-grade manpower system, that is, k = 3. Markovian manpower systems with three grades arise in many practical situations [1,3,4,7,8,13]. Following [12], the study assumes a fixed size manpower system that operates a policy that allows wastage to be replaced by new recruits.…”