Abstract
Basic elements of project planning are activity scheduling and resource allocation. In this study, meta-heuristic methods reviewed as an appropriate solution tool for resource-constrained project scheduling problem and the success of two meta-heuristic methods discussed. Resource constrained project scheduling problem which is an NP-hard problem solved with scatter search and genetic algorithm. Both algorithms do not disrupt the feasible search space during population generation. Algorithms compared in terms of resulting time and working principles. © 2011 IEEE.
Cite
CITATION STYLE
Sari, T., Cakir, V., Kilic, S., & Ece, E. (2011). Evaluation of scatter search and genetic algorithm at resource constrained project scheduling problems. In INES 2011 - 15th International Conference on Intelligent Engineering Systems, Proceedings (pp. 127–130). https://doi.org/10.1109/INES.2011.5954732
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.