Optimization Study of Construction Repetitive Project Scheduling Based on Big Data Background

This paper proposes the use of LOB method for repetitive project scheduling solution, and the use of branch limit algorithm to optimize LOB resource allocation to provide the best resource distribution scheme for construction projects. The control process types are analyzed and the time parameters of the LOB method are calculated. Introduce the resource constraint problem of repetitive projects, establish the objective function, put forward the relevant constraints of LOB resource allocation, combine the branching strategy, limiting strategy and pruning strategy, and construct the resource allocation process of LOB scheduling based on the branching and limiting algorithm. Select the parameters number of processes ($n$), maximum employable amount of processes ( k j ), and deadline tightness ( θ ), and conduct random generation tests to compare the performance of different LOB scheduling methods. The LOB scheduling schedule problem is described in the context of a construction project example, and the LOB resource allocation problem is solved by the branch-and-bound algorithm to obtain the optimal resource allocation scheme. Calculate the duration of each process after transformation is 12, 23, 13, 17.1, 12, 12. And the end time of the last process is 44.3, which satisfies the contract duration.