A scheduling problem for software project solved with ABC metaheuristic
MetadataShow full item record
The scheduling problems are very common in any industry or organization. The software project management is frequently faced with different scheduling problems.We present the Resource-Constrained Project Scheduling problem as a generic problem in which different resources must be assigned to different activities, so that the make span is minimized and a set of precedence constraints between activities and resource allocation to these activities are met. This Problem is a NPhard combinatorial optimization problem. In this paper we present the model the resolution of the problem through the Artificial Bee Colony algorithm. The Artificial Bee Colony is a metaheuristic that uses foraging behavior of honey bees for solving problems, especially applied to combinatorial optimization. We present an Artificial Bee Colony algorithm able to solve the Resource-Constrained Project Scheduling efficiently. © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
A new approach to solve the software project scheduling problem based on max–min ant system (2020) Crawford B.; Soto R.; Johnson F.; Monfroy E.; Paredes F. (Springer Verlag, 2014)
Software project scheduling using the Hyper-Cube ant colony optimization algorithm [Programiranje računarskog projekta primjenom Hyper-Cube algoritma za optimizaciju kolonije mrava] (2020) Crawford B.; Soto R.; Johnson F.; Misra S.; Paredes F.; Olguín E. (Strojarski Facultet, 2015)
Conference PaperCrawford B.; Soto R.; Johnson F.; Valencia C.; Paredes F. (Springer Verlag, 2016)