Evaluation Of Methods For Optimizing A Resource-Constrained Project. Part 2

Author(s):  
������� ◽  
Igor Tsarkov

Developing this subject, the author evaluates efficiency of various straight-through priority rules, used in constructive heuristic methods meant for reducing completion periods of projects with constrained renewable resources. Special attention is given to the so-called hybrid algorithms and dependence between efficiency of priority rules and network capacity. Efficiency of rules is analyzed based on sets of 480 PSPLIB projects: J30, J60, J90.

2019 ◽  
Vol 29 (1) ◽  
pp. 31-42 ◽  
Author(s):  
E.Kh. Gimadi ◽  
E.N. Goncharov ◽  
D.V. Mishin

We consider a resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities pre- emptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in form of the activity list. We use two approaches of constructing the lower bound. We present results of numerical experiments, illustrating the quality of the proposed lower bounds. The test instances are taken from the library of test instances PSPLIB.


Sign in / Sign up

Export Citation Format

Share Document