Modelos computacionais para o escalonamento de tarefas em redes de dutos / Computational models for task scheduling in pipeline networks
AUTOR(ES)
Andre Augusto Cire
DATA DE PUBLICAÇÃO
2008
RESUMO
This dissertation deals with a very difficult overly-constrained scheduling challenge: how to operate a large pipeline network in order to adequately transport oil derivatives and biofuels from refineries to local markets. Pipeline network systems are considered the major option for transporting these product types, in view of their many economic and environmental advantages. However, they pose serious operational difficulties related to product sequencing, flow rates and tank capacities. The challenge is how to schedule individual pumping operations, given the daily production and demand of each product, at each location in the network, over a given time horizon. In order to tackle this problem, we propose a novel hybrid approach which comprises two phases. Firstly, a planning phase decides the necessary volume transmission among depots to satisfy the given demands. Finally, a scheduling phase generates and schedules the pumping operations that guarantee the required volume transmission. This dissertation focuses on the scheduling phase, in which two new Constraint Programming (CP) models are proposed. The CP flexibility plays a key role in modeling and satisfying operational constraints that are usually overlooked in literature, but that are essential in rder to guarantee viable solutions. The full strategy was implemented and produced adequate and promising results when tested over 5 large real instances from Petrobras. These instances have a complex topology with around 30 interconnecting pipelines, over 30 different products in circulation, and about 14 distribution depots which harbor more than 200 tanks
ASSUNTO(S)
combinatorial optimization operational research otimização combinatoria pesquisa operacional petroleum transportation restrições (inteligencia artificial) petroleo - transporte
ACESSO AO ARTIGO
http://libdigi.unicamp.br/document/?code=000434428Documentos Relacionados
- ESCALONAMENTO DE TAREFAS DIVISÍVEIS EM REDES ESTRELA
- Comparative Study of Task Dependent Scheduling Algorithms to Grid Computing
- Escalonamento em grids computacionais: estudo de caso
- Algoritmos para escalonamento de tarefas dependentes representadas por grafos acíclicos direcionados em grades computacionais
- Uma heuristica de agrupamento de caminhos para escalonamento de tarefas em grades computacionais