Easy Heuristic Way of Compromise Schedules Finding in Projects with Double-Constrained Resources
Double-constrained resources are limited both on entire project, and for every period of its performance. Thus a project schedule formation problem represents a problem related to finding a tripartite compromise between project duration, and also renewable and non-renewable resources. It is one of the most difficult classes of tasks with determined parameters in which already at number of works in the project more than 20 it is possible to find the optimum solution only incidentally. Even heuristic methods are difficult and demand automation of calculations. In this work an algorithm and a set of recommendations will be presented which allow find problem solution’s optional versions practically in the manual mode even for the project with small number of works. The algorithm is adapted for such tasks Goyal method which is in turn based on the CPM-COST method, therefore this algorithm can be used for training of project managers and other experts, and it will promote better understanding of interrelations between the project’s key parameters.