A Grasp with Path-Relinking for the Workover Rig Scheduling Problem

View Sample PDF

Author(s): Alexandre Venturin Faccin Pacheco (Federal University of Espírito Santo – UFES, Brazil), Glaydston Mattos Ribeiro (Federal University of Espírito Santo – UFES, Brazil)and Geraldo Regis Mauri (Federal University of Espírito Santo – UFES, Brazil)
Copyright: 2012
Pages: 14
Source title: Nature-Inspired Computing Design, Development, and Applications
Source Author(s)/Editor(s): Leandro Nunes de Castro (Mackenzie University, Brazil)
DOI: 10.4018/978-1-4666-1574-8.ch005

Keywords: Bioinformatics / Biologically-Inspired Computing / Medical Information Science Reference / Medicine & Healthcare

Purchase

View A Grasp with Path-Relinking for the Workover Rig Scheduling Problem on the publisher's website for pricing and purchasing information.

Abstract

Onshore oil wells depend on special services like cleaning, reinstatement and stimulation. These services, which are performed by a short number of workover rigs, are important to keep oil production as optimum as possible. Consequently, scheduling must be determined, where several factors interfere, such as production, service to be performed on each well, and time windows for each service. When a well needs service, its production is interrupted. In this regard, the workover rig scheduling problem consists of finding the best sequence of wells, which minimizes the production loss associated with the wells waiting for maintenance. In this paper, the authors present a Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) to solve this problem. Computational results are obtained from real problems of a Brazilian oil field.

The IRMA Community

Research IRM

A Grasp with Path-Relinking for the Workover Rig Scheduling Problem

Purchase

Abstract

Related Content

IRMA Sponsors