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.
Berth allocation problem CP MIP Sequence-dependent setup Ship scheduling
This is a preview of subscription content, log in to check access.
This study was partially funded by the Center for Advances in Port Management, Lamar University, Beaumont, TX, USA. Authors greatly appreciate port agent J. J. Plunkett of the Houston Pilot Association for providing the data for this study and for reviewing the paper. Authors would also like to thank shipping agent Darren Shelton for reviewing and making comments on chemical tanker operations. Finally, the authors are grateful to the anonymous MEL reviewers and editor-in-chief for their constructive comments and careful attention to the paper which enhanced its quality.
Doulabi, S.H.H., M. Avazbeigi, S. Arab, and H. Davoudpour. 2012. An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem. The International Journal of Advanced Manufacturing Technology 59 (9–12): 1143–1155. https://doi.org/10.1007/s00170-011-3546-5.CrossRefGoogle Scholar
Huang, Y.M., and J.C. Lin. 2011. A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems. Expert Systems with Applications 38 (5): 5438–5447.CrossRefGoogle Scholar
IHS Global Insight, Inc. 2009. An evaluation of maritime policy in meeting the commercial and security needs of the United States. Washington, DC: IHS Global Insight.Google Scholar
International Maritime Organization (IMO). 2012. International shipping facts and figures: Information resources on trade safety, security and environment. London: International Maritime Organization.Google Scholar
Seeba, P. 2016. Coordinating chemical tanker movements on the houston ship channel. Gt. Houst, Port Bur.Google Scholar
Seraj, O., Tavakkoli-Moghaddam, R., and Jolai, F. 2009. A fuzzy multi-objective tabu-search method for a new bi-objective open shop scheduling problem. In 2009 International Conference on Computers and Industrial Engineering (pp. 164–169). IEEE. https://doi.org/10.1109/ICCIE.2009.5223549.
Shakhlevich, N., Y. Sotskov, and F. Werner. 2000. Complexity of mixed shop scheduling problems: A survey. European Journal of Operational Research 120 (2): 343–351.CrossRefGoogle Scholar