Abstract:

Resource Balance Problem (KDP) is solved by intuitive, modern intuitive and mathematical methods. But the methods specified cannot guarantee a precise solution, especially for large-scale problems. In this study it is calculated how many different business programs can be achieved by delaying the activities that have abundance in such a way as not violating the dependence relationships between activities of the KDP and not causing extension during the project period. With the testing of all the applicable business programs defined as the search space, the best solution of the KDP has been achieved in a guaranteed way and the solution of the KDP has been provided in a different way than the existing methods. The number of activities and the search space are derived from the upper linking formula for serial-related activities and the solution of large projects with a single processor is determined that it cannot be achieved in a reasonable time. Parallel programming ensures that the problem is shared to all processors in the same number of network solutions. In this study, the 4 KDP search spaces, the largest of which has 36 activity, have been scanned and solved in a reasonable time, and the method developed has been proved to be applied. With this method, the form of dividing into smaller pieces will be able to a precise solution to larger resource balance problems.

Keywords: