Abstract
This paper studies optimization models for two key aspects of manpower planning: steady state manpower flows and multi-period staff movements. Previous models for such manpower planning problems are largely formulated and solved as mathematical programs. In this paper, it is shown that in several practical instances, the problems are actually reducible to much simpler models that are solved using very efficient algorithms, without recourse to mathematical programming techniques. We have also found applications of our results in network flow optimization problems outside the area of manpower planning.
Get full access to this article
View all access options for this article.
