The aim of the paper is to present one possibility of how to model and solve a resource oriented critical path problem. As a starting point, a single criteria model for critical path finding is shortly mentioned. Lately, more criteria functions for this model are defined. If any project task uses more resources for its completion, its duration usually depends on only one of them – other resources are not fully used. In here defined multiple criteria approach, these dependencies are not assumed. Each criteria function is derived from a theoretical task duration based on a number of units of only one resource and on its importance. Using either linear programming model with aggregated criteria function or simple Excel calculation with Microsoft Project software support, a so-called compromise critical path can be found. On this path, some resources are overallocated and some are underallocated but the total sum of all underallocations and all overallocations is minimized. All resources are used as effectively as possible and the project is as short as possible too.
Multiple criteria network models for project management