Title: Algorithms for scheduling projects with generalized precedence relations
Authors: De Reyck, B
Demeulemeester, Erik
Herroelen, Willy
Issue Date: 1998
Publisher: K.U.Leuven - Departement toegepaste economische wetenschappen
Series Title: DTEW Research Report 9804 pages:1-31
Abstract: Project scheduling under the assumption of renewable resource constraints and generalized precedence relations, i.e. arbitrary minimal and maximal time lags between the starting and completion times of the activities of the project, constitutes an important and challenging problem. Over the past few years considerable progress has been made in the use of exact solution procedure for this problem type and its variants. We review the fundamental logic and report new computational experience with a branch-and-bound procedure for optimally solving resource-constrained project scheduling problems with generalized precedence relations of the precedence diagramming type, i.e. start-start, start-finish, finish-start and finish-finish relations with minimal time lags for minimizing the project makespan. Subsequently, we review and report new results for several branch-and -bound procedures for the case of generalized precedence relations, including both minimal and maximal time lags, and demonstrate how the solution methodology can be expected to cope with other regular and nonregular objective functions such a smaximizing the net present value of a project.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Research Center for Operations Management, Leuven

Files in This Item:
File Description Status SizeFormat
OR_9804.pdf Published 702KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.