Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm
- 3 September 2008
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 12 (3) , 281-298
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Modeling the supply chain configuration problem with resource constraintsInternational Journal of Project Management, 2008
- Constraint partitioning in penalty formulations for solving temporal planning problemsArtificial Intelligence, 2006
- Lower bounds for resource-constrained project scheduling problemsEuropean Journal of Operational Research, 2003
- Scheduling and constraint propagationDiscrete Applied Mathematics, 2002
- Optimization guided lower and upper bounds for the resource investment problemJournal of the Operational Research Society, 2001
- A linear programming and constraint propagation-based lower bound for the RCPSPEuropean Journal of Operational Research, 2000
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- Temporal constraint networksArtificial Intelligence, 1991
- Measures of the restrictiveness of project networksNetworks, 1977
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962