Exact method for single vessel and multiple quay cranes to solve scheduling problem at port of Tripoli-Lebanon

Abstract

This paper discusses the Quay Crane Scheduling Problem (QCSP) at port of Tripoli-Lebanon, determines the unloading/loading sequences of bays for quay cranes assigned to a single container vessel, provides a mixed integer programming model for the quay crane scheduling problem and proposes a dynamic programming algorithm to solve the QCSP. The objective of this paper is to minimize the completion time of unloading/loading containers and therefore to reduce the docking time of the vessel in the terminal. Finally the results of this paper are compared to the port results.