Maximizing the project's net present value with per-unit earliness and tardiness penalties as well as inventory holding cost

The net present value is an important measure for assessing the protability of long-term projects, yet project scheduling problems usually maximize it based on cash flows alone. We extend this objective to also account for per-unit earliness and tardiness penalties, as well as per-unit inventory holding cost incurred between activities. Given the per-unit penalties and cost, we present two time-discrete models. Although extensions of the net present value have been proposed before, their structural properties have received little attention. By analyzing our objective, we show that discounted per-unit inventory holding cost between activities can be reformulated as per-unit earliness and tardiness penalties. For these discounted per-unit penalties, we derive a continuous formulation and prove that an integer-valued optimal schedule always exists in the continuous relaxation. Accordingly, we develop a non-linear continuous model and are able to provide its linearization. Building on further structural properties, we also extend a steepest ascent approach developed for maximizing the projects net present value with solely cash flows. In experiments with projects under general temporal constraints, both the linear model and the steepest ascent approach solve instances with up to 1000 activities within seconds.

Authors

Publication Details

Journal
Publikationsserver der Technischen Universität Clausthal
Published
2026-11-16
Primary Topic
Resource-Constrained Project Scheduling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Maximizing the project's net present value with per-unit earliness and tardiness penalties as well as inventory holding cost

Lena Sophie Wohlert, Jürgen Zimmermann
Publikationsserver der Technischen Universität Clausthal
Resource-Constrained Project Scheduling
article

Maximizing the project's net present value with per-unit earliness and tardiness penalties as well as inventory holding cost

Lena Sophie Wohlert, Jürgen Zimmermann
article en

Abstract

The net present value is an important measure for assessing the protability of long-term projects, yet project scheduling problems usually maximize it based on cash flows alone. We extend this objective to also account for per-unit earliness and tardiness penalties, as well as per-unit inventory holding cost incurred between activities. Given the per-unit penalties and cost, we present two time-discrete models. Although extensions of the net present value have been proposed before, their structural properties have received little attention. By analyzing our objective, we show that discounted per-unit inventory holding cost between activities can be reformulated as per-unit earliness and tardiness penalties. For these discounted per-unit penalties, we derive a continuous formulation and prove that an integer-valued optimal schedule always exists in the continuous relaxation. Accordingly, we develop a non-linear continuous model and are able to provide its linearization. Building on further structural properties, we also extend a steepest ascent approach developed for maximizing the projects net present value with solely cash flows. In experiments with projects under general temporal constraints, both the linear model and the steepest ascent approach solve instances with up to 1000 activities within seconds.

Publikationsserver der Technischen Universität Clausthal
Resource-Constrained Project Scheduling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon