We consider two linear project time–cost tradeoff problems with multiple milestones. Unless a milestone is completed on time, penalty costs for tardiness may be imposed. However, these penalty costs can be avoided by compressing the processing times of certain jobs that require additional...

We consider a continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs. If a milestone is tardy, a penalty cost may be imposed. The processing times of jobs can be compressed by additional resources or activities that incur compression costs. The objective is...

In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph coloring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the...

In this paper, we address the issue of optimal selection of portfolio of projects using reinvestment strategy within a flexible time horizon. We assume that an investor intends to invest his/her initial capital on the implementation of some projects in a flexible time horizon. The investor’s...

In this paper we propose an adaptive model for multi-mode project scheduling under uncertainty. We assume that there is a due date for concluding the project and a tardiness penalty for failing to meet this due date, and that several distinct modes may be used to undertake each activity. We...

It is generally accepted that the three major dimensions of project success are time, budget, and quality. Most of the research in project planning is focused on the time-cost trade-off, and only a few papers have considered the three dimensions together. This paper describes the evolution of...