In this paper we introduce the concept of due date assignment in the project scheduling literature. Despite the fact that due date assignment problems belongs to the core of the machine scheduling literature, no attempts have been made to tackle this problem in a project scheduling environment....

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively...

In literature, both topological and resource-related measures are used to predict the difficulty of a project scheduling problem. Rapid progress regarding solution procedures has resulted in the development of a number of data generators in order to generate instances under a controlled design...

Recently, time-switch constraints have been introduced in literature by Yang and Chen (2000). Basically, these constraints impose a specified starting time on the project activities and force them to be inactive during specified time periods. This type of constraints have been incorporated into...

The resource-constrained project scheduling problem (RCPSP) is one of the most challenging problems in project scheduling. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions for...