A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
Author:
- 9 February 2005
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 103 (3) , 515-539
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Scheduling Computer and Manufacturing Processes2001
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- Resource-constrained project scheduling: A survey of recent developmentsComputers & Operations Research, 1998
- PSPLIB - A project scheduling problem libraryEuropean Journal of Operational Research, 1997
- Practical problem solving with cutting plane algorithms in combinatorial optimization1995
- Resource-Constrained Scheduling of Projects with Variable-Intensity ActivitiesIIE Transactions, 1990
- Integer and Combinatorial Optimization1988
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956