A general planning method for allocation of human resource groups

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Planning (creating optimized plans)i s the key feature of every management system. The behavior of human resources, especially the domain of description of cooperation in groups is not easy to model. Generally, this kind of planning is a classic NP problem and, together with the need of variable project structures and project flows, it leads to a very complex computational task. To perform allocations of qualified human resources within a dynamic environment we propose a specific non analytical multiobjective function. Our first target is to get optimal resource groups at any time and in such a way that global project time is minimal and that constraints of costs are satisfied. To meet these requirements we use a specific three(3)tier optimizer architecture with different methodologies: fuzzy sets, numeric non gradient methods and evolutionary computation methods. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Mauerkirchner, M. (2001). A general planning method for allocation of human resource groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2178 LNCS, pp. 172–181). Springer Verlag. https://doi.org/10.1007/3-540-45654-6_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free