Show simple item record

dc.rights.licenseAtribución-NoComercial 4.0 Internacional
dc.contributor.authorMorillo Torres, Daniel
dc.contributor.authorMoreno Velasquez, Luis Fernando
dc.contributor.authorDíaz Serna, Francisco Javier
dc.date.accessioned2019-07-02T19:01:41Z
dc.date.available2019-07-02T19:01:41Z
dc.date.issued2015-03-01
dc.identifier.issnISSN: 2346-2183
dc.identifier.urihttps://repositorio.unal.edu.co/handle/unal/60750
dc.description.abstractThis paper addresses the Resource Constrained Project Scheduling Problem (RCPSP). For its solution, a hybrid methodology, which uses a Branch and Bound basic algorithm with dominance rules, is developed and implemented, and is combined with four deterministic heuristics whose objective is to prune the search tree branches, taking into account the iterations available and, at the same time, to minimize the probability of discarding branches that contain optimal solutions. Essentially, these strategies allow the allocation of most iterations to the most promissory regions in an organized manner using only subsets with similar or the same characteristics as those of the optimal solutions at each level of the tree, thus assuring a broad search within the feasible region and, simultaneously, a good exploitation by the selective use of the subsets by level. Finally, the developed algorithm performance is analyzed by solving some of the problems of the PSPLIB test library.
dc.format.mimetypeapplication/pdf
dc.language.isospa
dc.publisherUniversidad Nacional de Colombia (Sede Medellín). Facultad de Minas.
dc.relationhttps://revistas.unal.edu.co/index.php/dyna/article/view/43855
dc.relation.ispartofUniversidad Nacional de Colombia Revistas electrónicas UN Dyna
dc.relation.ispartofDyna
dc.rightsDerechos reservados - Universidad Nacional de Colombia
dc.rights.urihttp://creativecommons.org/licenses/by-nc/4.0/
dc.subject.ddc62 Ingeniería y operaciones afines / Engineering
dc.titleA branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP)
dc.typeArtículo de revista
dc.type.driverinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dc.identifier.eprintshttp://bdigital.unal.edu.co/59082/
dc.relation.referencesMorillo Torres, Daniel and Moreno Velasquez, Luis Fernando and Díaz Serna, Francisco Javier (2015) A branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP). DYNA, 82 (190). pp. 198-207. ISSN 2346-2183
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess
dc.subject.proposalProject scheduling
dc.subject.proposalresource constraints
dc.subject.proposaldeterministic heuristic methods
dc.subject.proposalhybrid algorithm
dc.type.coarhttp://purl.org/coar/resource_type/c_6501
dc.type.coarversionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.contentText
dc.type.redcolhttp://purl.org/redcol/resource_type/ART
oaire.accessrightshttp://purl.org/coar/access_right/c_abf2


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial 4.0 InternacionalThis work is licensed under a Creative Commons Reconocimiento-NoComercial 4.0.This document has been deposited by the author (s) under the following certificate of deposit