A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields

Onshore oil wells are dependent of maintenance services such as cleaning, reinstatement and stimulation. These services can be performed by a limited number of workover rigs. Usually, wells need maintenance services and a scheduling of the workover rigs must be defined. This scheduling must consider some factors such as the well production, the type of service to be performed and time windows for the service. There is a production loss associated to wells waiting for maintenance services, so it is important to attend them as soon as possible. Thus, the workover rig scheduling problem consists of finding the best schedule for the limited number of workover rigs, minimizing the production loss associated with the wells waiting for maintenance service. We present a simple and robust Simulated Annealing (SA) algorithm for solving this problem. Computational results on real problems obtained in Brazil are reported and SA presents better solutions than all those approaches reported in the literature.

[1]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[2]  Celso C. Ribeiro,et al.  Scheduling workover rigs for onshore oil production , 2006, Discret. Appl. Math..

[3]  J. S. Aronofsky,et al.  Linear Programming A Problem-Solving Tool for Petroleum Industry Management , 1962 .

[4]  John N. Tsitsiklis,et al.  Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.

[5]  Wayne E. Smith Various optimizers for single‐stage production , 1956 .

[6]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[7]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[8]  J. J. Brennan,et al.  Scheduling a Backlog of Oilwell Workovers , 1977 .

[9]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[10]  J. J. Brennan,et al.  Scheduling a backlog of oil well workovers , 1976 .

[11]  W. A. Greaney,et al.  A Stochastic Inventory Model for Scheduling Development Drilling , 1971 .

[12]  Shimon Even,et al.  Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[13]  Alexandre César Muniz de Oliveira,et al.  A Hybrid Column Generation Approach for the Berth Allocation Problem , 2008, EvoCOP.

[14]  R. Paiva,et al.  Otimização do itinerario de sondas de intervenção , 1997 .

[15]  Gilbert Laporte,et al.  Models and Tabu Search Heuristics for the Berth-Allocation Problem , 2005, Transp. Sci..

[16]  Luiz Antonio Nogueira Lorena,et al.  Customers' satisfaction in a dial-a-ride problem , 2009, IEEE Intelligent Transportation Systems Magazine.

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  R. O. Paiva,et al.  Optimizing the Itinerary of Workover Rigs , 2000 .