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.
Year of publication: |
2009
|
---|---|
Authors: | Cambini, Riccardo ; Riccardi, Rossana |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 198.2009, 3, p. 741-747
|
Publisher: |
Elsevier |
Keywords: | Discrete programming Discrete convexity Optimal fleet mix |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Theoretical and algorithmic results for a class of hierarchical fleet mix problems
Cambini, Riccardo, (2009)
-
Optimality conditions for differentiable linearly constrained pseudoconvex programs
Cambini, Riccardo, (2024)
-
Theoretical and algorithmic results for a class of hierarchical fleet mix problems
Cambini, Riccardo, (2009)
- More ...