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.