Abstract:
In the first part of the work, a model of continuous scheduling of the construction of a group of wells using dedicated labor resources and technical means was described. A multi-stage combinatorial algorithm for finding an effective work schedule based on dynamic programming and aggregation methods is proposed. This part uses a simple numerical example to analyze the practical effectiveness of combinatorial search algorithms depending on the availability of information about the flow rate of new wells. It is characteristic that the calendar plans obtained with the help of software-implemented combinatorial search algorithms are consistent with the generally understood methods of drawing up «manual» schedules. This fact makes it possible to reduce the dimension of combinatorial analysis problems in a controlled way. A multiplicative formula for calculating the well construction time is proposed taking into account its complexity and the skills of the drilling crew. Quantitative performance indicators are formulated that allow the selection of alternative calendar plans. The screening procedure for «clone» solutions using the Hamming distance matrix is described.
First page:
PDF файл