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

Authors:
Virginia Yannibelli;Analía Amandi
Affiliations:
ISISTAN Research Institute, UNCPBA, Argentina and CONICET, Argentina, Tandil, Argentina;ISISTAN Research Institute, UNCPBA, Argentina and CONICET, Argentina, Tandil, Argentina
Venue:
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Year:
2012

Citing 8
Cited 1

Effective Software Project Management

Effective Software Project Management
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm

Journal of Scheduling
Editorial: Hybrid learning machines

Neurocomputing
An evolutionary squeaky wheel optimization approach to personnel scheduling

IEEE Transactions on Evolutionary Computation
Editorial: Hybrid intelligent algorithms and applications

Information Sciences: an International Journal
A knowledge-based evolutionary assistant to software development project scheduling

Expert Systems with Applications: An International Journal
Editorial: Editorial: New trends and applications on hybrid artificial intelligence systems

Neurocomputing
Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling

Hybridizing a multi-objective simulated annealing algorithm with a multi-objective evolutionary algorithm to solve a multi-objective project scheduling problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.