A memetic approach to project scheduling that maximizes the effectiveness of the human resources assigned to project activities

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

Abstract

In this paper, we address a project scheduling problem that considers a priority optimization objective for project managers. This objective involves assigning the most effective set of human resources to each project activity. To solve the problem, we propose a memetic algorithm. This is a hybrid algorithm that combines an evolutionary algorithm and a local search algorithm. To evaluate the performance of the memetic algorithm, we report the computational experiments carried out on six different instance sets. Then, we compare the performance of the memetic algorithm with that of the evolutionary algorithm previously proposed in literature for solving the addressed problem. The obtained results show that the memetic algorithm outperforms the previous evolutionary algorithm. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Yannibelli, V., & Amandi, A. (2012). A memetic approach to project scheduling that maximizes the effectiveness of the human resources assigned to project activities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7208 LNAI, pp. 159–173). https://doi.org/10.1007/978-3-642-28942-2_15

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