Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorJohnson F.
dc.contributor.authorValencia C.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:39Z
dc.date.available2020-09-02T22:15:39Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-33625-1_40
dc.identifier.citation464, , 449-458
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4145
dc.descriptionThis paper describes the Software Project Scheduling Problem (SPSP) as a combinatorial optimization problem. In this problem raises the need for a process to assign a set of resources to tasks for a project in a given time, trying to decrease the duration and cost. The workers are the main resource in the project. We present the design of the resolution model to solve the SPSP using an algorithm of fireflies (Firefly Algorithm, FA). We illustrate the experimental results in order to demonstrate the viability and soundness of our approach. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z.
dc.subjectFirefly algorithm
dc.subjectMetaheuristic
dc.subjectProject management
dc.subjectSoftware project scheduling problem
dc.subjectAlgorithms
dc.subjectArtificial intelligence
dc.subjectBioluminescence
dc.subjectCombinatorial optimization
dc.subjectFire protection
dc.subjectIntelligent systems
dc.subjectProject management
dc.subjectScheduling
dc.subjectCombinatorial optimization problems
dc.subjectFirefly algorithms
dc.subjectMetaheuristic
dc.subjectProject scheduling problem
dc.subjectResolution modeling
dc.subjectSoftware Project Scheduling
dc.subjectOptimization
dc.titleFirefly algorithm to solve a project scheduling problem
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record