A container yard is a storage facility that allows handling resources to improve operational efficiency by facilitating container flows at a container terminal. The container yard system consists of a set of storage blocks with yard cranes performing stacking and unstacking operations for containers to be transported by vehicles. High operational efficiency can be achieved by managing and coordinating the handling operations of yard cranes and vehicles (e.g., the yard crane scheduling, vehicle job dispatching, and coordinating handshakes between yard cranes and vehicles). This study proposes an integrated optimization approach for simultaneously determining the yard crane schedules and the vehicle parking positions under the Chebyshev movement allowing for the simultaneous movement of gantry and trolley of the yard crane. A mixed-integer programming model is formulated to optimize the problem, and the two-stage heuristic algorithm is developed to solve the problem efficiently. Several propositions are also provided to search the optimal boundary of vehicle parking slots for pairs of jobs. Numerical experiments are conducted to show the outperformance of the proposed heuristic algorithm compared to the well-known rule-based heuristics.

集装箱堆场是一种存储设施，通过便利在集装箱码头的集装箱流动，可以处理资源以提高运营效率。集装箱堆场系统由一组带有堆场起重机的存储块组成，这些堆场起重机对要由车辆运输的集装箱执行堆放操作。通过管理和协调堆场起重机和车辆的搬运操作（例如，堆场起重机调度，车辆作业调度以及协调堆场起重机和车辆之间的握手），可以实现较高的运营效率。这项研究提出了一种综合优化方法，用于同时确定切比雪夫运动下的院子起重机时间表和停车位，从而允许院子起重机的龙门架和手推车同时运动。建立了混合整数规划模型以优化问题，并开发了两阶段启发式算法来有效地解决问题。还提供了几个命题来搜索车辆停车位的最佳边界以寻找成对的工作。数值实验表明，与基于规则的启发式算法相比，该算法具有更好的性能。