This paper aims to gain insight into capacity allocation, downsizing decisions and sequencing rules when managing a portfolio of projects. By downsizing, we mean reducing the scale or size of a project and thereby changing the project's content. In previous work, we have determined the amount of...

We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for this problem, which make a number of a-priori sequencing decisions in a pre-processing phase, while the remaining decisions are made dynamically...

We study the problem of scheduling a project so as to maximize its expected net present value when task durations are exponentially distributed. Based on the structural properties of an optimal solution we show that, even if preemption is allowed, it is not necessary to do so.Next to its...

We study the stochastic resource-constrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of policies that is a generalization of most of the classes described in the literature. A policy...

In this paper, we model a research-and-development project as consisting of several modules, with each module containing one or more activities. We examine how to schedule the activities of such a project in order to maximize the expected profit when the activities have a probability of failure...

We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for regular as well as nonregular capacity. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as...

The purpose of this paper is to propose models for project scheduling when there is considerable uncertainty in the activity durations, to the extent that the decision maker cannot with confidence associate probabilities with the possible outcomes of a decision.Our modeling techniques stem from...

This article describes a heuristic for scheduling so-called ‘modular' projects. Exact solutions to this NP-hard problem can be obtained with existing branch-and-bound and dynamic-programming algorithms, but only for small to medium-size instances. The proposed heuristic, by contrast, can be...