This paper explores the Gantry Cranes Scheduling Problem (GCSP), specifically focusing on determining the optimal slot unloading/loading sequences for gantry cranes assigned to containers in a block of stacking. The gantry crane scheduling proposed in this paper, which is mathematically modeled by a mixed integer programming model is proposed. using the terminal operating system used in the port studied provides a new (MILP). Finally, the paper compares the results obtained from the proposed model with those of the terminal port for real instances.

Over the last few years, the application of operations research techniques to solve various optimization problems has become a very important issue. This paper examines two of the most common problems in maritime logistics, the berth allocation problem and the quay cranes assignment problem, and solves them in a hierarchical integration. Finally, real data from a Tunisian port is used to demonstrate the efficiency of hierarchical optimization.

The berth allocation problem (BAP) is one of the key decision problems at port terminals. It has been widely studied by many of research works. In this paper, the dynamic and discrete case of the BAP in a bulk port was studied, a mathematical model was proposed and solved using Cplex whose the objective is to minimize the total service time of berthed vessels. The proposed model was tested and validated through numerical experiments based on instances inspired from data of the bulk port of Sidi Youssef Sfax, Tunisia. It succeeded in finding good solutions compared to the results achieved by the port planning team.