Firefly algorithm to solve a project scheduling problem

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorJohnson, F.es_ES
dc.contributor.authorValencia, C.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T15:56:00Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T15:56:00Z
dc.date.issued2016
dc.description.abstractThis 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.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-33625-1_40es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-33625-1_40
dc.language.isoenges_ES
dc.publisherSpringer Verlages_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceAdvances in Intelligent Systems and Computinges_ES
dc.subjectComputer Sciencees_ES
dc.subjectEngineeringes_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleFirefly algorithm to solve a project scheduling problemes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
56. Firefly algorithm to solve a project scheduling problem.pdf
Tamaño:
217.39 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso