Scheduling workover rigs for onshore oil production

Hybrid adaptive memory programming using GRASP and path relinking for the scheduling workover rigs for onshore oil production

“…To our knowledge there is only one proposal heuristic to solve this problem, which uses VNS concepts [2]. However, the instances used in [2] are not available, making it difficult to compare with other proposals. In this paper we propose the development and experimental analyzis of GRASP algorithms to solve the SWRP.…”

“…Oil can be lifted by different techniques, which require specialized equipment. As time passes maintenance service is necessary because of equipment failure, which is essential to the exploitation of the wells [2]. This service is performed by workover rigs, that are avaliable in a limited number because of the high cost of that equipment.…”

“…The SWRP is a NP-Hard problem [2], which justifies the development of heuristic algorithms. To our knowledge there is only one proposal heuristic to solve this problem, which uses VNS concepts [2]. However, the instances used in [2] are not available, making it difficult to compare with other proposals.…”

“…The workover rigs schedule for the onshore oil production problem consists in finding for each period the best schedule for avaliable workover rigs to attend all wells demanding maintanance service, therefore minimizing the oil production loss. The production loss is evaluated as the mean daily yield of the well under regular operation, multiplied by the number of days its production is interrupted [2]. The SWRP is a NP-Hard problem [2], which justifies the development of heuristic algorithms.…”

“…The production loss is evaluated as the mean daily yield of the well under regular operation, multiplied by the number of days its production is interrupted [2]. The SWRP is a NP-Hard problem [2], which justifies the development of heuristic algorithms. To our knowledge there is only one proposal heuristic to solve this problem, which uses VNS concepts [2].…”