Cross-docking is a logistics strategy that consolidates the products of different inbound trucks according to their destinations in order to reduce the inventory, order picking, and transportation costs. It requires a high level of collaboration between inbound trucks, internal operations, and outbound trucks. This article addresses the truck-to-door sequencing problem. Truck-to-door sequencing has been studied by some researchers in different titles such as scheduling and sequencing of inbound and outbound trucks of the cross-dock center. However, previous studies have not considered repeat truck holding pattern. Therefore, it is important to determine the doors and the sequence of the inbound and outbound trucks that should be assigned in a cross-dock center. This paper focuses on optimizing truck-to-door sequencing with consideration of repeat truck holding pattern in inbound trucks in order to minimize makespan. Two methods are considered to solve this problem, including mathematical modeling and a heuristic algorithm. In the first method, a mixed integer-programming model is developed to minimize the makespan. Then, GAMS software is used to solve small-scale problems. In the second approach, a heuristic algorithm is developed to find near-optimal solutions within the shortest time possible and the algorithm is used to solve large-scale problems. The results of the mathematical model and the heuristic algorithm are slightly different and show the good quality of the presented heuristic algorithm.