3 research outputs found
Theoretical and algorithmic results for a class of hierarchical fleet mix problems
In this paper a workforce model is studied from both a theoretical and an algorithmic point of view. In the considered hierarchical model workforce units can be substituted by higher qualified ones; external workforce can also be hired to cover low qualified jobs. An exact recursive solution algorithm is proposed to solve the problems and its efficiency is improved by means of cut conditions and discrete convexity properties. Finally, the results of a computational test are provided. (C) 2008 Elsevier B.V. All rights reserved
Theoretical and algorithmic results for a class of hierarchical fleet mix problems
In this paper a workforce model is studied from both a theoretical and an algorithmic point of view. In the considered hierarchical model workforce units can be substituted by higher qualified ones; external workforce can also be hired to cover low qualified jobs. An exact recursive solution algorithm is proposed to solve the problems and its efficiency is improved by means of cut conditions and discrete convexity properties. Finally, the results of a computational test are provided.Discrete programming Discrete convexity Optimal fleet mix