Port space allocation with a time dimension
From MaRDI portal
Recommendations
Cited in
(18)- The berth planning problem
- A note on a dynamic space-allocation method for outbound containers.
- Queue-constrained packing: a vehicle ferry case study
- Exact and heuristic methods for placing ships in locks
- Storage yard operations in container terminals: literature overview, trends, and research directions
- Operations research at container terminals: a literature update
- A critical-shaking neighborhood search for the yard allocation problem
- Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching
- A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension
- Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations
- scientific article; zbMATH DE number 2040744 (Why is no real title available?)
- Manpower allocation with time windows
- Short-term space allocation for storage yard management in a transshipment hub port
- Dynamic space allocation for temporary storage
- An investigation into yard allocation for outbound containers
- Space and time allocation in a shipyard assembly hall
- The service allocation problem at the Gioia Tauro maritime terminal
- AS/RS based yard and yard planning
This page was built for publication: Port space allocation with a time dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428975)