The offshore resources scheduling problem: Detailing a constraint programming approach

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The development of maritime oil wells depends on the availability of specialized fleet capable of performing the required activities. In addition, the exploitation of each well can only start when it is connected through pipes to a producing unit. The Offshore Resources Scheduling Problem (ORSP) combines such restrictions with the aim to prioritize development projects of higher return in oil production. In this work, an extended description of the ORSP is tackled with Constraint Programming (CP). Such extension refers to the customization of pipes and to the scheduling of fleet maintenance periods. The use of CP is due to the noted ability of the technique to model and solve large and complex scheduling problems. For the type of scenarios faced by Petrobras, the reported approach was able to quickly deliver good-quality solutions. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Serra, T., Nishioka, G., & Marcellino, F. J. M. (2012). The offshore resources scheduling problem: Detailing a constraint programming approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7514 LNCS, pp. 823–839). https://doi.org/10.1007/978-3-642-33558-7_59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free