Abstract
The article considers the mathematical formulation of the Resource-Constrained Project Scheduling Problem (RCPSP). The RCPSP structure is represented by a graph. The article regards some special cases of RCPSP for which at present there exist either exact deterministic polynomial algorithms for their solving or approximate heuristic algorithms that find an approximate optimal solution in polynomial time.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.