Resource levelling for projects with schedule-dependent time windows

The paper presents polynomial heuristic procedures for different types of resource levelling problems for projects with minimum and maximum time lags between project activities. Both problems without and with explicit resource constraints are treated. Thus far, only pseudopolynomial heuristics for special resource levelling problems without maximum time lags and resource constraints have been proposed. An experimental performance analysis shows that the new heuristics approximately solve problem instances with up to 500 activities and five resources within reasonable computing time.