Iterated greedy for the yard crane scheduling problem with input/output assignment

DOI10.1016/J.EJOR.2025.04.052MaRDI QIDQ6891813zbMATH OpenFDO

Authors Hong Tao Wang, Rubén Ruiz, F. Villa, Eva Vallada

Publication date 2 December 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.04.052

zbMATH Keywords

heuristicsinput/output assignmentiterated greedyterminal planningyard crane scheduling problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A stochastic model for the throughput analysis of passing dual yard cranes
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• An exact method for scheduling a yard crane
• An optimal routing algorithm for a transfer crane in port container terminals
• Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations
• Constraint programming models for integrated container terminal operations
• Discrete time model and algorithms for container yard crane scheduling
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Scheduling automated triple cross-over stacking cranes in a container yard
• Scheduling of container storage and retrieval
• Solving the yard crane scheduling problem with dynamic assignment of input/output points
• Yard crane scheduling for container storage, retrieval, and relocation
• Yard crane scheduling in port container terminals
• Yard crane scheduling in the ground trolley-based automated container terminal

Cited in

(2)

• Advances in multi-crane scheduling: extended non-interference modeling and temporal-constraint-based valid inequalities
• Scheduling of yard cranes and multi-load automated guided vehicles leveraging container substitutability

This page was built for publication: Iterated greedy for the yard crane scheduling problem with input/output assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891813)