Location of Repository

An exact procedure for the unconstrained weighed earliness-tardiness project scheduling problem.

By M Vanhoucke, Erik Demeulemeester and Willy Herroelen


In this paper we study the unconstrained project scheduling problem with weighted earliness-tardiness penalty costs subject to zero-lag finish-start precedence constraints. Each activity of this unconstrained project scheduling problem has a known deterministic due date, a unit earliness penalty cost and a unit tardiness penalty cost. The objective is to schedule the activities in order to minimize the weighted earliness-tardiness penalty cost of the project, in the absence of constraints on the use of resources. With these features the problem setting become highly attractive in just-in-time environments.We introduce a two-step recursive algorithm. The first step consists of a forward pass procedure which schedules the activities such that they finish at their due date or later. The second step applies a recursive search in which the activities are eventually shifted backwards (topwards time zero) in order to minimize the weighted earliness-tardiness cost of the project. The procedure has been coded in Visual C++, version 4.0 under Windows NT 4.0 and has been validated on a randomly generated data set.Scheduling;

OAI identifier:

Suggested articles



  1. (1998). A classification scheme for project scheduling problems", in:
  2. (1995). A new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags", WIOR-Report-449, Institut flir Wirtschaftstheorie und Operations Research,
  3. (1970). An experimental and comparative evaluation of production line balancing techniques",
  4. (1998). An optimal procedure for the resourceconstrained project scheduling problem with discounted cash flows and generalized precedence relations",
  5. (1997). Project network models with discounted cash flows: A guided tour through recent developments",

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.