The container premarshalling problem under limited crane time: a constraint programming approach
From MaRDI portal
Cites work
- A beam search algorithm for minimizing crane times in premarshalling problems
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A branch and bound approach for large pre-marshalling problems
- A feasibility-based heuristic for the container pre-marshalling problem
- A heuristic for retrieving containers from a yard
- A multi-heuristic approach for solving the 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 efficient ant colony optimization algorithm for the blocks relocation problem
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Integer programming models for the pre-marshalling problem
- Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
- 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
- The quay crane scheduling problem with time windows
Cited in
(3)
This page was built for publication: The container premarshalling problem under limited crane time: a constraint programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568426)