Solving the Twin Yard Crane Scheduling Problem in Automated Container Terminals This study focuses on scheduling twin Automated Stacking Cranes (ASCs) that collaborate to serve storage and retrieval jobs from opposite ends of a block. Since the ASCs cannot cross each other, there is a handshake bay that serves as a temporary storage location so that one crane can leave a job for the other to complete. A proposed mixed integer programming model that aims to minimize the time required to finish all jobs is formulated and solved. Four modes of crane interference that may occur at the handshake bay are taken into consideration. This paper is the first to investigate the effect of different handshake bay locations on the objective value when a task is split into jobs, and results show that the handshake bay location has no effect on the objective value if the task is split into jobs of equal number of size.

A Mathematical Model for Internal Task Scheduling in Cross Docking This study proposes a novel problem for solving task scheduling in cross docking. In particular, we formulate a mathematical model for the task scheduling between inbound and outbound dock doors in order to minimize total operational time based on limited resource. The goal is to determine the start time and finish time of each operation on the assigned working team and transfer equipment with respect to maximum resource utilization. The use of mathematical model is paving the way to Artificial Intelligence (AI) for smart decision in cross docking since AI is a key factor in Industries 4.0. Moreover, facility cost is analyzed based on tradeoff features between cost and makespan so that a decision can be made based on a decision makeru0027s preference.