Abstract
The article investigates the combinatorial problem of the formation of coordinated work schedules, ensuring the continuous loading of the allocated labor resources for the construction of a group of wells. A parametric mathematical model of continuous scheduling, taking into account a number of restrictions on the organization of the well construction process, is proposed. The model is supplemented with a simple formula for calculating the time characteristics of the well construction depending on the drilling conditions and the drilling crew qualification. The universal nature of the basic model of continuous scheduling allows you to easily transform the model for many practical applications. A multi-criteria algorithm for finding the best planning options based on the methods of dynamic programming and aggregation of the initial planning task taking into account the flow rate of wells under construction is developed. For the selection of alternative solutions, a system of performance indicators and a number of criteria are proposed, taking into account not only the construction procedure and routes of drilling equipment, but also important economic factors, including the time risks of performing planned tasks. The novelty of the work lies in the fact that instead of the "manual" approach to the preparation of a single suitable calendar plan, a methodology for solving calendar planning problems is proposed, based on the development of adequate combinatorial search algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.