Title: Local search methods for the discrete time/resource trade-off problem in project networks
Authors: De Reyck, B
Editors: Demeulemeester, Erik
Contributors: Herroelen, Willy
Issue Date: 1997
Publisher: K.U.Leuven - Departement toegepaste economische wetenschappen
Series Title: DTEW Research Report 9710 pages:1-50
Abstract: Abstract:
In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations specifying that an activity can only start when al of its predecessors have been completed), in which the duration of the activities is a discrete, on-increasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity a work content is specified such that all execution modes (duration-resource pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on subdividing the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported.
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_9710.pdf Published 1038KbAdobe PDFView/Open


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