Illyés László: Cohesion and balance in a human resource allocation problem. In: Acta cybernetica, (19) 1. pp. 93-103. (2009)
Preview |
Cikk, tanulmány, mű
actacyb_19_1_2009_6.pdf Download (140kB) | Preview |
Abstract
Collaborative work appears between intelligent agents of different types. The problem discussed occurred when many construction workers were taken to Germany from Romania to work in construction projects. Managers have to make independent groups of workers from some categories, like carpenters, brick layers, etc. To discover their collaborative attitudes they use the scoring method, where every worker scores the others from different trades. The objectives are to form groups of workers with high compatibility value and to have a high compatibility value for the worst group, too. The problem becomes more interesting if software collaborative groups or specialized intelligent agents are involved. One has to prospect also the level of knowledge overlap between the trade groups of agents. This paper resumes to the problem of construction workers so as there is no overlap between the trades and the level of knowledge is not in the universe of discourse. We propose a Greedy and a genetic algorithm approach and we compare these methods.
Item Type: | Article |
---|---|
Journal or Publication Title: | Acta cybernetica |
Date: | 2009 |
Volume: | 19 |
Number: | 1 |
ISSN: | 0324-721X |
Page Range: | pp. 93-103 |
Language: | English |
Place of Publication: | Szeged |
Event Title: | Conference for PhD Students in Computer Science (6.) (2008) (Szeged) |
Related URLs: | http://acta.bibl.u-szeged.hu/38527/ |
DOI: | 10.14232/actacyb.19.1.2009.6 |
Uncontrolled Keywords: | Számítástechnika, Kibernetika |
Additional Information: | Bibliogr.: p. 102-103. ; összefoglalás angol nyelven |
Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
Date Deposited: | 2016. Oct. 15. 12:25 |
Last Modified: | 2022. Jun. 17. 09:09 |
URI: | http://acta.bibl.u-szeged.hu/id/eprint/12854 |
Actions (login required)
![]() |
View Item |