An Optimization Based Heuristic for Scheduling Parallel Project Networks with Constrained Renewable Resources
- 1 June 1988
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 20 (2) , 137-143
- https://doi.org/10.1080/07408178808966162
Abstract
In this paper we address the scheduling problem for the simultaneous management of multiple resource constrained project networks in parallel. This situation is common in the construction of a housing development where the building contractor is concerned with the simultaneous completion of a number of individual, identical construction projects. If only one project were managed, a resource constrained critical path method could be utilized. In this paper we present a model for the simultaneous planning of many individual project networks. We formulate the problem as an integer program that is similar to models found in the inventory/production scheduling literature. A Dantzig-Wolfe decomposition is used to obtain solutions to the linear programming relaxation of the problem. The algorithm selects a subset of these solutions to form a final schedule. Computational results are presented. Extensions of the algorithm, including non-identical projects, alternative objective functions and implementation on a rolling horizon are also discussed.Keywords
This publication has 4 references indexed in Scilit:
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling ProblemsManagement Science, 1978
- Project scheduling: The effects of problem structure on heuristic performanceNaval Research Logistics Quarterly, 1976
- Alternate methods of project scheduling with limited resourcesNaval Research Logistics Quarterly, 1973
- An Algorithm for Optimal Project Scheduling under Multiple Resource ConstraintsManagement Science, 1971