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

The problem of scheduling multiple, large scale, make-to-order assemblies is considered. Beside "classical" precedence- and resource constraints as known from resource constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to...

We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products. Based on a list scheduling procedure which has...

The resource investment problem deals with the issue of providing resources to a project such that a given deadline can be met. The objective is to make the resources available in the cheapest possible way. For each resource, expenses depend on the maximum amount required during the course of...

In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time-cost tradeoff problem which has been extensively studied in the past. However, the discrete version of the problem which is of great...

The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible sequences are provided. Second, an algorithm is...

The Capacitated Facility Location Problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning. A variety of lower bounds based on Lagrangean relaxation and subgradient optimization has been proposed for this problem. However, in...