Title: A chemical tanker scheduling problem: Port of Houston case study

Authors: Burak Cankaya; Ezra Wari; Berna Eren Tokgoz

Addresses: Department of Technology Management, Embry-Riddle Aeronautical University Worldwide, 600 S. Clyde Morris Blvd., Daytona Beach, FL 32114, USA ' Department of Industrial Engineering, Lamar University, Cherry Engineering Building, P.O. Box 10032, Beaumont, TX, USA ' Department of Industrial Engineering, Lamar University, Cherry Engineering Building, P.O. Box 10032, Beaumont, TX, USA

Abstract: The objective of this study was to develop scheduling solutions for chemical vessels in a port. Chemical tankers carry multiple liquid cargos and have to visit multiple terminals to load/unload these cargos. The practice to date in scheduling these loading/unloading activities for the Port of Houston (PoH) has primarily involved manual methods, which result in several inefficiencies such as long waiting times and inefficient resource utilisation. This paper proposes three methods for tanker-scheduling problems, formulated as an open-shop scheduling problem with sequence-dependent post-set-up times: a mixed-integer programming (MIP); a constraint programming (CP); and a dispatching rule, longest processing time (LPT) scheduling heuristic. Overall, the results showed the MIP method to be a more suitable tool for hourly and daily scheduling, whereas the CP and the LPT heuristic proved suitable for longer-horizon scheduling problems (weekly, monthly, or semi-annual) and for use as real-time scheduling tools.

Keywords: ship scheduling; berth allocation problem; sequence-dependent set-up; mixed-integer programming; MIP; constraint programming; CP; dispatching rule; open shop heuristics.

DOI: 10.1504/IJPS.2019.103029

International Journal of Planning and Scheduling, 2019 Vol.3 No.1, pp.47 - 67

Received: 01 Oct 2018
Accepted: 15 Mar 2019

Published online: 11 Oct 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article