Mixed-integer linear programming model for tree-like pipeline scheduling problem with intermediate due dates on demands

M. Taherkhani, M. Seifbarghy (), R. Tavakkoli-Moghaddam and P. Fattahi
Additional contact information
M. Taherkhani: Islamic Azad University
M. Seifbarghy: Alzahra University
R. Tavakkoli-Moghaddam: University of Tehran
P. Fattahi: Alzahra University

Operational Research, 2020, vol. 20, issue 1, No 16, 399-425

Abstract: Abstract Multi-product pipelines are a significant and extensive mean of transporting petroleum based products from refineries to distribution centers. Previous contributions on tree-like pipeline scheduling problem have considered a simple structure with a single refinery connected to a mainline and some secondary lines only emerged from the mainline. In practice, however, a tree-like pipeline may also have several branches on a secondary line resulting in a complex structure, the so called multi-level tree-like pipeline. This paper addresses the short-term scheduling of multi-level tree-like pipelines with multiple refineries through a continuous time mixed-integer linear programming (MILP) model that considers multiple intermediate due dates for product demands. The objective is to satisfy product demands on time at the minimum operational costs, such as pumping, interface and backorder costs. The proposed model performance’s is shown by solving four examples.

Keywords: Multi-product pipelines; Tree-like structure; Scheduling; Mixed-integer linear programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12351-017-0329-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:20:y:2020:i:1:d:10.1007_s12351-017-0329-2

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-017-0329-2

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().