Policies for accessions and promotions of personnel have a good effect on their morale and motivation, and stability of their career prospects in a graded manpower system such as a military officer manpower system. Hence, it is very important to plan accessions and promotions with rationality in such a manpower system.
Most of manpower planning problems inherently involve multiple objectives, such as minimization of operating cost of personnel, attainability and maintainability of the desired profile of manpower, and consistency of promotion.
The purpose of this thesis is to develop a multiobjective mathematical programming framework for planning accessions and promotions in a graded manpower system. Three objectives are considered in the problem: (1) attainability and maintainability of the desired grade profile of manpower, (2) inertia rule of promotions, and (3) fairness of promotion opportunity. Also this thesis provides an interactive solution procedure for the problem, which is illustrated by an application to the aggregated operating problem of a military officer manpower system. And the interactive approach can be extended to the vector maximum problem.
