Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
