Pages that link to "Item:Q2503090"
From MaRDI portal
The following pages link to A critical-shaking neighborhood search for the yard allocation problem (Q2503090):
Displayed 12 items.
- Tactical berth allocation under uncertainty (Q320125) (← links)
- Short-term space allocation for storage yard management in a transshipment hub port (Q480771) (← links)
- Online rules for container stacking (Q989634) (← links)
- An integrated model for berth and yard planning in container terminals with multi-continuous berth layout (Q1730671) (← links)
- Flexible space-sharing strategy for storage yard management in a transshipment hub port (Q1944872) (← links)
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
- Storage yard operations in container terminals: literature overview, trends, and research directions (Q2256283) (← links)
- Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← links)
- Operations research at container terminals: a literature update (Q2480797) (← links)
- A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension (Q2669688) (← links)
- An investigation into yard allocation for outbound containers (Q5189826) (← links)
- Some complexity results and an efficient algorithm for quay crane scheduling problem (Q5298341) (← links)