<p>In automated container terminals (ACTs) utilizing automated lifting vehicles (ALVs), the apron and block buffer zones are critical components that decouple the operations of the three key types of handling equipment: quay cranes (QCs), ALVs, and automated stacking cranes (ASCs). By temporarily storing containers, these buffer zones allow for asynchronous operations among equipment, significantly enhancing equipment utilization and system flexibility. However, their limited capacities also create a system bottleneck, and inefficient scheduling can easily lead to mutual equipment waiting and operational blocking. To address this challenge, this paper investigates the integrated scheduling problem of QCs, ALVs, and ASCs with limited apron and block buffer zone capacities. The key decisions involve the ASC-job sequence, job-to-ALV assignment, and ALV-job sequence. First, a mixed-integer linear programming (MILP) model is formulated using different approaches to model the capacity constraints of the distinct buffer zones. Second, an encoding method for key decisions is developed to generate the insertion sequence of container jobs. Then, by analyzing the characteristics of buffer zones, two types of sequence rules are designed, and a method for calculating terminal equipment schedules is derived from the proposed model. Finally, a sequential insertion algorithm (SIA), an SIA-based adaptive large neighborhood search algorithm, and a lower bound method are proposed to solve mid- and large-sized cases. Numerical experiments demonstrate that the proposed algorithms perform well and offer advantages over off-the-shelf solvers. Based on the experimental findings, managerial implications for the operation and management of automated container terminals are discussed.</p>