Container pre-Marshalling problem under the same-group exclusive strategy
From MaRDI portal
Cites work
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A branch and bound approach for large pre-marshalling problems
- A constraint programming approach for the premarshalling problem
- A feasibility-based heuristic for the container pre-marshalling problem
- A new effective unified model for solving the pre-marshalling and block relocation problems
- A tree search procedure for the container pre-marshalling problem
- An optimization model for the container pre-marshalling problem
- Container relocation problem with time windows for container departure
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Integer programming models for the pre-marshalling problem
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem
- Pre-processing a container yard under limited available time
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- Solving the robust container pre-marshalling problem
- Storage yard operations in container terminals: literature overview, trends, and research directions
- The container premarshalling problem under limited crane time: a constraint programming approach
This page was built for publication: Container pre-Marshalling problem under the same-group exclusive strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239561)