On the complexity of container stowage planning problems

DOI10.1016/j.dam.2014.01.005zbMath1297.90144DBLPjournals/dam/TierneyPJ14OpenAlexW2157190477WikidataQ59406971 ScholiaQ59406971MaRDI QIDQ2449077

Kevin Tierney, Dario Pacino, Rune Møller Jensen

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.01.005

zbMATH Keywords

computational complexityliner shippingcontainer stowageoverstowage

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (10)

Loading, unloading and premarshalling of stacks in storage areas: survey and classification ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Robust storage loading problems with stacking and payload constraints ⋮ Scheduling cranes at an indented berth ⋮ An exact algorithm for the unrestricted block relocation problem ⋮ A biased random-key genetic algorithm for the container pre-marshalling problem ⋮ An asymptotically optimal algorithm for online stacking ⋮ Uncertainty in maritime ship routing and scheduling: a literature review ⋮ Integer linear programming models for the containership stowage problem ⋮ Matheuristics for slot planning of container vessel bays

Cites Work

• Unnamed Item
• Unnamed Item
• Container ship stowage problem complexity and connection to the coloring of circle graphs
• Interval scheduling on identical machines
• Container stowage planning: a methodology for generating computerised solutions
• The complexity of colouring circle graphs

This page was built for publication: On the complexity of container stowage planning problems