workers, related by a relationship called “Trust”, to cover the requirements of a set of projects, i.e. to assign the available workers competences to the ones required to execute the activities correctly. The problem can be solved using an approach based on two algorithms. The first algorithm, dealing with the Steiner Tree method, finds the optimal set of workers that cover the requirements of a set of projects considering the worker’s trust. The second one, through operations research techniques, gives a three-phase solution of the problem. The first phase performs admissibility conditions to find the admissibility of the project, i.e. to check the execution feasibility of that project. The second phase is devoted to the computation of the best pool of satisfiable projects. Successively, if one of admissibility conditions is not satisfied, in order to find, anyway, a solution and the corresponding gap between competences, in the third phase an algorithm is introduced based on the archetype of the classical assignment problem. The goal is to find the best assignment considering two sets of competences, respectively one referred to the workers and the other one referred to the project.

A Team Formation Methodology in Human Resource Management

D'APICE, Ciro;DE NICOLA, CARMINE;SALERNO, Saverio
2013-01-01

Abstract

workers, related by a relationship called “Trust”, to cover the requirements of a set of projects, i.e. to assign the available workers competences to the ones required to execute the activities correctly. The problem can be solved using an approach based on two algorithms. The first algorithm, dealing with the Steiner Tree method, finds the optimal set of workers that cover the requirements of a set of projects considering the worker’s trust. The second one, through operations research techniques, gives a three-phase solution of the problem. The first phase performs admissibility conditions to find the admissibility of the project, i.e. to check the execution feasibility of that project. The second phase is devoted to the computation of the best pool of satisfiable projects. Successively, if one of admissibility conditions is not satisfied, in order to find, anyway, a solution and the corresponding gap between competences, in the third phase an algorithm is introduced based on the archetype of the classical assignment problem. The goal is to find the best assignment considering two sets of competences, respectively one referred to the workers and the other one referred to the project.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11386/3899769
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact