Critical chain project scheduling problem based on the thermodynamic particle swarm optimization algorithm

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

Abstract

For the project progress optimization problem, an improved particle swarm optimization algorithm based on thermodynamic mechanism is introduced and applied to the research and optimization of critical chain project scheduling. Experiments prove that the thermodynamic particle swarm optimization algorithm outperforms the basic particle optimization algorithm in solving such problems. The experimental results can serve as a theoretical guidance for administrators and decision-makers in enterprises to manage project administration in an overall and accurate way, take control of the project progress and guarantee the completion of a project on time. © Springer-Verlag Berlin Heidelberg 2012.

Cite

CITATION STYLE

APA

Xu, X., Hu, H., Hu, N., & Ying, W. (2012). Critical chain project scheduling problem based on the thermodynamic particle swarm optimization algorithm. In Communications in Computer and Information Science (Vol. 345, pp. 340–346). https://doi.org/10.1007/978-3-642-35211-9_44

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