This paper analyses the current state of research regarding solution methods dealing with resource-constrained project scheduling problems. The intention is to present a concentrated survey and brief scientific overview on models, their decision variables and constraints as well as current solution methods in the field of project scheduling. The allocation of scarce resources among multiple projects with different, conflicting decision variables is a highly difficult problem in order to achieve an optimal schedule which meets all (usually different) of the projects’ objectives. Those projects, e.g. the assembly of complex machinery and goods, consume many renewable, e.g. workforce/staff, and non-renewable, e.g. project budget, resources. Each single process within these projects can often be performed in different ways – so called execution modes can help to make a schedule feasible. On the other hand the number of potential solutions increases dramatically through this fact. Additional constraints, e.g. min/max time lags, preemption or specific precedence relations of activities, lead to highly complex problems which are NP-hard in the strong sense.

This paper analyses the current state of research regarding solution methods dealing with resource-constrained project scheduling problems. The intention is to present a concentrated survey and brief scientific overview on models, their decision variables and constraints as well as current solution methods in the field of project scheduling. The allocation of scarce resources among multiple projects with different, conflicting decision variables is a highly difficult problem in order to achieve an optimal schedule which meets all (usually different) of the projects’ objectives. Those projects, e.g. the assembly of complex machinery and goods, consume many renewable, e.g. workforce/staff, and non-renewable, e.g. project budget, resources. Each single process within these projects can often be performed in different ways – so called execution modes can help to make a schedule feasible. On the other hand the number of potential solutions increases dramatically through this fact. Additional constraints, e.g. min/max time lags, preemption or specific precedence relations of activities, lead to highly complex problems which are NP-hard in the strong sense.