A branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP)
Open Access
- 11 May 2015
- journal article
- Published by Universidad Nacional de Colombia in DYNA
- Vol. 82 (190) , 198-207
Abstract
A branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP)Keywords
This publication has 24 references indexed in Scilit:
- Lower bounds for resource-constrained project scheduling problemsEuropean Journal of Operational Research, 2003
- An integrated survey of deterministic project schedulingOmega, 2001
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical FormulationManagement Science, 1998
- Resource-constrained project scheduling: A survey of recent developmentsComputers & Operations Research, 1998
- Scheduling with forbidden setsDiscrete Applied Mathematics, 1997
- Project scheduling with resource constraints: A branch and bound approachEuropean Journal of Operational Research, 1987
- Multiple Resource–Constrained Scheduling Using Branch and BoundA I I E Transactions, 1978
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part IOperations Research, 1973
- An Algorithm for the Line Balancing ProblemManagement Science, 1964