Solving resource availability cost problem in project scheduling by pseudo particle swarm optimization

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish all activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of solving the resource availability cost problem (RACP) by using start time of each activity to code the schedule. Then, a novel heuristic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimization (PPSO) combined with PSO and path relinking procedure is presented to solve the RACP. Finally, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP. © 1990-2011 Beijing Institute of Aerospace Information.

Cite

CITATION STYLE

APA

Qi, J., Guo, B., Lei, H., & Zhang, T. (2014). Solving resource availability cost problem in project scheduling by pseudo particle swarm optimization. Journal of Systems Engineering and Electronics, 25(1), 69–76. https://doi.org/10.1109/JSEE.2014.00008

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