Title: An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem
Authors: Vanhoucke, M
Demeulemeester, Erik
Herroelen, Willy
Issue Date: 1999
Publisher: K.U.Leuven - Departement toegepaste economische wetenschappen
Series Title: DTEW Research Report 9911 pages:1-16
Abstract: In this paper we study the resource-constrained project scheduling problem with weighted earliness-tardiness penalty costs. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness-tardiness penalty cost of the project subject to the finish)start precedence constraints and the constant renewable resource availability constraints. With these features the problem becomes highly attractive in just-in -time environments.We introduce e depth-first branch-and-bound algorithm for the unconstrained weighted earliness-tardiness problem to compute lower bounds. The procedure has been coded in Visual C++, version 4.0 under Windows NT and has been validated on a randomly generated problem set.
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_9911.pdf Published 403KbAdobe PDFView/Open


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