The scheduling problem in a container terminal is characterized by high level of coordination of different types of equipment. In this paper we present an integrated model to schedule these equipment at the same time with the objective to minimize the makespan, or the time it takes to serve a given set of ships. The problem is formulated as a Hybrid Flow Shop Scheduling problem with precedence and Blocking constraints (HFSS-B). A tabu search algorithm is proposed to solve this problem. Certain mechanisms are developed and introduced into the algorithm to assure the quality and efficiency of the algorithm. The performance of the tabu search algorithm is analyzed from the computational point of view.