Title: Optimal procedures for the discrete time cost trade-off problem in project networks
Authors: Demeulemeester, Erik ×
Herroelen, WS
Elmaghraby, SE #
Issue Date: Jan-1996
Publisher: Elsevier science bv
Series Title: European journal of operational research vol:88 issue:1 pages:50-68
Abstract: We describe two algorithms, based on dynamic programming logic, for optimally solving the discrete time/cost trade-off problem (DTCTP) in deterministic activity-on-are networks of the CPM type, where the duration of each activity is a discrete, nonincreasing function of the amount of a single nonrenewable resource committed to it. The first algorithm is based on a procedure proposed by Bein, Kamburowski and Stallmann for finding the minimal number of reductions necessary to transform a general network to a series-parallel network. The second algorithm minimizes the estimated number of possibilities that need to be considered during the solution procedure. Both procedures have been programmed in C and tested on a large set of representative networks to give a good indication of their performance, and indicate the circumstances in which either algorithm performs best.
ISSN: 0377-2217
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Management, Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
Optimalprocedures.pdf Published 1412KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


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

© Web of science