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

Investment projects consist of activities which are interrelated by techno-logical and resource constraints. The timing of payments depends on the scheduling of the activities which is not known a priory. Hence, the decision to be made, is to find a feasible Investment schedule with maximum net...

We consider the classical resource-constrained project scheduling problem (RCPSP). The paper gives a detailed algorithmic description and provides theoretical results on two widely known problem specific heuristics: The serial and the parallel scheduling scheme. An in-depth computational study...