Preemptive scheduling of a single yard crane for terminal efficiency

OPSEARCH · Springer Nature · 2026-11-06 · DOI: 10.1007/s10479-026-07474-6

Аннотация

Concentrated vehicle arrivals at limited input/output points often cause severe queuing and prolonged waiting times in automated container terminals. This study addresses a preemptive single yard crane scheduling problem in a perpendicular-layout terminal. Preemption allows the crane to temporarily interrupt a container move, stage it at an intermediate slot, serve another request, and later complete the operation. To minimize a weighted sum of makespan and total operational delay (comprising vehicle waiting and storage delays), we formulate a mixed-integer linear programming model and develop an iterated greedy framework with four preemptive variants. Extensive computational experiments confirm that at least one preemptive variant consistently outperforms a non-preemptive baseline across all problem sizes and objectives. Under the balanced objective, preemptive scheduling reduces total vehicle waiting time by 7.4–61.2%, while makespan impacts range from a 2.8% increase to a 1.7% reduction. Furthermore, average and maximum vehicle queues decrease across all operating regimes. Sensitivity analysis shows that preemption benefits scale positively with greater weight on operational delay and sufficient scheduling flexibility. These findings advocate for selective preemption policies, enabling operators to prioritize requests with substantial waiting-time savings while effectively bounding storage-delay risks.

Читать у издателя →

Похожие статьи