Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal
From MaRDI portal
Publication:5112420
DOI10.1142/S0217595920500074zbMath1439.90037OpenAlexW3017717462MaRDI QIDQ5112420
Publication date: 29 May 2020
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595920500074
job sequencinggenetic algorithmant colony algorithmground trolley-based automated container terminalnested partition framework
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- A mathematical formulation and complexity considerations for the blocks relocation problem
- Short-term space allocation for storage yard management in a transshipment hub port
- Applying the corridor method to a blocks relocation problem
- Crane scheduling in container yards with inter-crane interference
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- An optimization model for the container pre-marshalling problem
- Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal
- Two-stage nested partitions method for stochastic optimization
- Storage yard operations in container terminals: literature overview, trends, and research directions
- An exact method for scheduling a yard crane
- Operations research at container terminals: a literature update
- An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals
- Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations
- Interblock Crane Deployment in Container Terminals
- Nested Partitions Method for Global Optimization
This page was built for publication: Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal
