The scheduling of quay cranes is a global problem that all the ports of the world seek to solve, with the main objective of minimizing the loading and clearing time of container ships and thus reducing the berthing time in the marine terminals. It consists of assigning each gantry crane to a set of bays for a given ship while sequencing the unloading of these bays. In a previous study, they discussed different methods whose main drawback is the difficulty of obtaining
results for large instances. Therefore, in this article, we propose a genetic algorithm that allows us to overcome this and quickly obtain near-optimal solutions. We have tested and validated our method on real instances from the port.