A new method of project schedule levelling
A new method of project schedule levelling

Summary/Abstract: We consider the problem of project schedule levelling and propose a new algorithm, based on the pattern matching algorithms. The activity resource requirements and free resources are considered as two patterns which are to be matched. We explain the idea of the algorithm (the pattern matching algorithms have to be modified in order to be used to solve the problem in question) and prove its computational complexity, which turns out to be O(n2).

• Details
• Contents