In this article, we delve into the intricacies of the container handling scheduling problem, particularly focusing on scenarios involving one quay crane and multiple transport trucks, with the added complexity of integrating front-end trucks at the storage area's entrance. This configuration presents a variant of the well-known Quay Crane and Yard Truck Scheduling Problem (QCYTSP). To tackle this challenge effectively, we present a comprehensive approach comprising two exact methods a linear program formulation and a numerical algorithm to derive an optimal solution. Additionally, recognizing the practical need for efficient solutions within reasonable timeframes, we introduce a Metaheuristic method, specifically a genetic algorithm, aimed at generating solutions closely approaching optimality while maintaining acceptable execution times. The primary objective throughout is to minimize the overall handling time of containers, spanning from their arrival at the port via ship to their placement within the storage area. To validate the effectiveness of our proposed methods, we conduct extensive comparisons across various sets of instances, encompassing both benchmark scenarios from existing literature and real-world cases observed at the port of Casablanca in Morocco. This rigorous evaluation allows us to assess our approach's practical applicability and robustness across diverse operational contexts, there by contributing valuable insights to container terminal management and logistics optimization.