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...

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...

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....

Project control has been a research topic since decades that attracts both academics and practitioners. Project control systems indicate the direction of change in preliminary planning variables compared with actual performance. In case their current project performance deviates from the planned...

Due to its complexity and relevance in practice, many different procedures have been proposed in the operations research literature to solve the well-known nurse scheduling problem (NSP). The NSP assigns nurses to shifts per day maximizing the overall quality of the roster while taking various...

In this paper we study the resource-constrained project-scheduling problem with discounted cash flows. Each activity of this resource-constrained project-scheduling problem has certain resource requirements and a known deterministic cash flow that can be either positive or negative....

This paper presents a genetic algorithm and a scatter search procedure to solve the well-known job shop scheduling problem. In contrast to the single population search performed by the genetic algorithm, the scatter search algorithm splits the population of solutions in a diverse and...