Numerous exact algorithms have been developed for solving the resource-constrained project scheduling problem. Experimental studies have shown that currently even projects with only 60 activities cannot be optimally solved within a reasonable amount of time. Therefore heuristics employing...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...

We consider an extension of the classical resource-constrained project scheduling problem (RCPSP), which covers discrete resource-resource and time-resource tradeoffs. As a result a project scheduler is permitted to identify several alternatives or modes of accomplishment for each activity of...

This study assesses the quality of seven commercial project management packages to schedule precedence- and resource-constrained projects. We introduce the basic project scheduling model and give a short survey of optimal and heuristic Solution methods. Furthermore, we outline extensions of the...

This study assesses the quality of seven commercial project management systems to perform finite scheduling. We give a brief survey of the way commercial project management systems work and especially how they perform finite scheduling. Since the implemented methods are proprietary, we measure...