Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- 20 April 2011
- journal article
- Published by Springer Nature in 4OR
- Vol. 9 (4) , 371-389
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A new formulation of the resource‐unconstrained project scheduling problem with generalized precedence relations to minimize the completion timeNetworks, 2010
- Project Scheduling With Feeding Precedence Relations: An Application to Production Planning2008
- RCPS with Variable Intensity Activities and Feeding Precedence Constraints2006
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activitiesMathematical Programming, 2005
- Project Scheduling with Time Windows2002
- Project Scheduling with Time Windows and Scarce Resources2002
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)Management Science, 1992
- Scheduling project networks with resource constraints and time windowsAnnals of Operations Research, 1988
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970