Algorithm of composing the schedule of construction and installation works

Energy Management of Municipal Transportation Facilities and Transport - EMMFT 2017

Nehaj, Rustam^1 ; Molotkov, Georgij^1 ; Rudchenko, Ivan^1 ; Grinev, Anatolij^1 ; Sekisov, Aleksandr^1

Kuban State Agrarian University Named after I.T. Trubilin, Krasnodar, Russia^1

关键词: Boundary method;    Computational algorithm;    Lower boundary;    Minimax;    Numerical values;    Optimal solutions;    Random Numbers;    Work performance;   

Others  :  https://iopscience.iop.org/article/10.1088/1755-1315/90/1/012019/pdf
DOI  :  10.1088/1755-1315/90/1/012019

来源: IOP

【 摘 要 】

An algorithm for scheduling works is developed, in which the priority of the work corresponds to the total weight of the subordinate works, the vertices of the graph, and it is proved that for graphs of the tree type the algorithm is optimal. An algorithm is synthesized to reduce the search for solutions when drawing up schedules of construction and installation works, allocating a subset with the optimal solution of the problem of the minimum power, which is determined by the structure of its initial data and numerical values. An algorithm for scheduling construction and installation work is developed, taking into account the schedule for the movement of brigades, which is characterized by the possibility to efficiently calculate the values of minimizing the time of work performance by the parameters of organizational and technological reliability through the use of the branch and boundary method. The program of the computational algorithm was compiled in the MatLAB-2008 program. For the initial data of the matrix, random numbers were taken, uniformly distributed in the range from 1 to 100. It takes 0.5; 2.5; 7.5; 27 minutes to solve the problem. Thus, the proposed method for estimating the lower boundary of the solution is sufficiently accurate and allows efficient solution of the minimax task of scheduling construction and installation works.