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

Affiliation auteurs!!!! Error affiliation !!!!
TitreExact method for single vessel and multiple quay cranes to solve scheduling problem at port of Tripoli-Lebanon
Type de publicationConference Paper
Year of Publication2018
AuteursSkaf A., Lamrous S., Hammoudan Z., Manier M.A
Conference Name2018 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM)
PublisherIEEE; IEEE TEMS Thailand Chapter; IEEE TEMS Singapore Chapter; IEEE TEMS Hong Kong Chapter
Conference Location345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN Number978-1-5386-6786-6
Mots-clésCase study, Mixed Integer Linear Programming, Optimization, quay crane, scheduling problem
Résumé

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.