Practical approaches to chemical tanker scheduling in ports: a case study on the Port of Houston

Burak Cankaya, Ezra Wari and Berna Eren Tokgoz ()
Additional contact information
Burak Cankaya: Embry-Riddle Aeronautical University Worldwide
Ezra Wari: Lamar University
Berna Eren Tokgoz: Lamar University

Maritime Economics & Logistics, 2019, vol. 21, issue 4, No 7, 559-575

Abstract: Abstract The objective of this study was to develop practical scheduling solutions for chemical tankers visiting the Port of Houston (PoH). Chemical tanker movements represent approximately 42% of the Houston Ship Channel traffic. Historically, chemical tanker scheduling has been problematic and has resulted in long waiting times for tankers. Scheduling is difficult because chemical tankers carry several liquid cargoes and must visit multiple terminals for loading and unloading. Physical constraints (layout of the port and draft) and commercial constrains (such as terminal and personnel readiness for cargo handling operations, tank cleaning processes, and inspection requirements) create a complex scheduling problem, long waiting times, and unnecessary tanker movements in the port. These problems cause an increase in the business costs for shipowners, risk of collisions and allisions, production of additional air emissions, and decreases in the operating capacity of terminals. The recent expansion decisions for chemical and petrochemical plants in Houston, Texas, will exacerbate the problem. Significant benefits could thus be gained even for small scheduling improvements. Currently, the scheduling practice of loading/unloading activities in the PoH involves primarily the manual and de-centralized use of the “first come, first served” (FCFS) rule, which results in inefficiencies such as long waiting times and poor resource utilization. We propose two mathematical methods to address the tanker scheduling problem in the port: a mixed-integer programming (MIP) method, and a constraint programming (CP) method. The two methods are formulated as open-shop scheduling problems with sequence-dependent post-setup times. MIP yields optimum results that minimize makespan. However, computation time increases significantly as the number of tankers, or the number of terminals, increases. CP achieves better makespan results in a shorter run time, compared to MIP, for medium to large-scale problems including the problem considered in this case study. Overall, the results show that MIP is more suitable for real-time scheduling tools (hourly and daily), whereas CP is the better option for longer-horizon scheduling problems (weekly or monthly). Our models gave good alternative schedules under short optimization run times. Hence, they can afford decision makers sufficient time to complete multiple optimization scenarios and implementation setups.

Keywords: Berth allocation problem; CP; MIP; Sequence-dependent setup; Ship scheduling (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1057/s41278-019-00122-w Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:marecl:v:21:y:2019:i:4:d:10.1057_s41278-019-00122-w

Ordering information: This journal article can be ordered from
http://www.springer. ... nt/journal/41278/PS2

DOI: 10.1057/s41278-019-00122-w

Access Statistics for this article

Maritime Economics & Logistics is currently edited by Hercules E. Haralambides

More articles in Maritime Economics & Logistics from Palgrave Macmillan, International Association of Maritime Economists (IAME) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().