Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
From MaRDI portal
Publication:4456079
DOI10.1002/nav.10076zbMath1043.90045MaRDI QIDQ4456079
Publication date: 15 March 2004
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10076
90C59: Approximation methods and heuristics in mathematical programming
90B90: Case-oriented studies in operations research
Related Items
Models and algorithms for a yard crane scheduling problem in container ports, A reclaimer scheduling problem arising in coal stockyard management, Yard crane scheduling for container storage, retrieval, and relocation, Real-time scheduling for twin RMGs in an automated container yard, Discrete time model and algorithms for container yard crane scheduling, Scheduling reclaimers serving a stock pad at a coal terminal, Carbon-efficient deployment of electric rubber-tyred gantry cranes in container terminals with workload uncertainty, Scheduling reclaimer operations in the stockyard to minimize makespan, Vehicle Routing Problems and Container Terminal Operations – An Update of Research, AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM
Cites Work
