Efficient formulation for transportation scheduling of single refinery multiproduct pipelines

DOI10.1016/j.ejor.2020.12.034zbMath1487.90149OpenAlexW3116142187MaRDI QIDQ2030316

Yanyan Li

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.034

zbMATH Keywords

transportationdiscrete-timemixed-integer linear programmingpipeline scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem

Cites Work

• The discrete time window assignment vehicle routing problem
• Short-term scheduling of multiple source pipelines with simultaneous injections and deliveries
• Planning of multi-product pipelines by economic lot scheduling models
• Optimizing the pipeline planning system at the National Oil Company
• A matheuristic decomposition approach for the scheduling of a single-source and multiple destinations pipeline system
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• On the scheduling of real world multiproduct pipelines with simultaneous delivery
• Disjunctive Programming

This page was built for publication: Efficient formulation for transportation scheduling of single refinery multiproduct pipelines