Solving the robust container pre-marshalling problem

DOI10.1007/978-3-319-44896-1_9zbMath1374.90276DBLPconf/iccl2/TierneyV16OpenAlexW2517551234WikidataQ60145756 ScholiaQ60145756MaRDI QIDQ1680086

Kevin Tierney, Stefan Voß

Publication date: 22 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-44896-1_9

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (7)

Robust optimization for premarshalling with uncertain priority classes ⋮ A constraint programming approach for the premarshalling problem ⋮ A branch and bound approach for large pre-marshalling problems ⋮ Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm ⋮ Robust storage assignment in stack- and queue-based storage systems ⋮ Optimizing pre-processing and relocation moves in the stochastic container relocation problem ⋮ An exact algorithm for the block relocation problem with a stowage plan

This page was built for publication: Solving the robust container pre-marshalling problem