zbMATH — the first resource for mathematics

On the disjunctive graph for project scheduling. (English) Zbl 0902.90097
Summary: An extension of the disjunctive model, efficiently representing the jobshop scheduling (JS) problem, to the more general resource-constrained project scheduling (RCPS) problem is proposed. The extension considers different groups of resources used by activities in different amounts limited to a constant value in every moment of the project duration. A solution to the problem is represented by a project resource flow diagram. Two kinds of project resource flow modifications – serial and parallel – are proposed in order to define a good neighborhood structure. This allows to efficiently apply local search techniques like simulated annealing or tabu search.

90B35 Deterministic scheduling theory in operations research