Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
Open Access
- 31 August 2019
- journal article
- research article
- Published by Elsevier BV in Petroleum Science
- Vol. 16 (5), 1159-1175
- https://doi.org/10.1007/s12182-019-00359-3
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Operational scheduling of refined product pipeline with dual purpose depotsApplied Mathematical Modelling, 2013
- A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminalsTransportation Research. Part E, Logistics and Transportation Review, 2012
- Scheduling multi-product tree-structure pipelinesComputers & Chemical Engineering, 2011
- Optimal Scheduling of Refined Products Pipelines with Multiple SourcesIndustrial & Engineering Chemistry Research, 2009
- Heuristic batch sequencing on a multiproduct oil distribution systemComputers & Chemical Engineering, 2009
- The multi-product pipeline scheduling systemComputers & Mathematics with Applications, 2008
- A decomposition framework for the scheduling of single- and multi-stage processesComputers & Chemical Engineering, 2006
- Partitioning procedures for solving mixed-variables programming problemsComputational Management Science, 2005
- Efficient MILP formulations and valid cuts for multiproduct pipeline schedulingComputers & Chemical Engineering, 2004
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962