This is the authors' abstract. We don't add key points for this paper.
Crude oil is primarily transported through sea using very large tankers. Efficient scheduling of these tankers is challenging as well as critical given long lead times, tight delivery time windows and high operational costs. We attempt to solve such a scheduling problem for an oil supplier facing supply quota and port capacity constraints. A mixed-integer programming formulation and two time-dependent solution techniques are proposed. Numerical results suggest that computing time was a function of the number, starting location, and time to availability of tankers at the supply sources. Finally, a time-based decomposition technique is presented to solve large problem instances, illustrating substantial reductions in computing time for marginally worse-off solutions.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Siddiqui et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: