In this paper an improved set of benchmark instances for the simple assembly line balancing problem is presented. The benchmark set currently available consists of instances with 7 to 297 tasks to be executed. Although claims made in the literature state that instances with up to 1000 tasks can...

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