Single quay crane and multiple yard trucks scheduling problem with integration of reach-stacker cranes at port of Tripoli-Lebanon

Affiliation auteurs!!!! Error affiliation !!!!
TitreSingle quay crane and multiple yard trucks scheduling problem with integration of reach-stacker cranes at port of Tripoli-Lebanon
Type de publicationConference Paper
Year of Publication2019
AuteursSkaf A., Lamrous S., Hammoudan Z., Manier M.A
Conference Name2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC)
PublisherIEEE
Conference Location345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN Number978-1-7281-4569-3
Mots-clésCase study, Dynamic programming, MILP, Optimization, quay crane, scheduling problem, yard truck
Résumé

This paper addresses the scheduling problem in port of Tripoli-Lebanon for a single quay crane with multiple yard trucks, all containers that will be unloaded from the vessel are in the same bay. The objective is to reduce the completion time of all containers from the vessel to their store location, we used a mixed integer linear programming and a dynamic programming algorithm to solve the problem. Finally, we have compared and validated our results on real instances from the port.