A branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP)

This 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 t...

Full description

Autores:
Morillo Torres, Daniel
Moreno Velasquez, Luis Fernando
Díaz Serna, Francisco Javier
Tipo de recurso:
Article of journal
Fecha de publicación:
2015
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/60750
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/60750
http://bdigital.unal.edu.co/59082/
Palabra clave:
62 Ingeniería y operaciones afines / Engineering
Project scheduling
resource constraints
deterministic heuristic methods
hybrid algorithm
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional