Complexity results for storage loading problems with stacking constraints

DOI10.1016/J.EJOR.2015.09.036MaRDI QIDQ321101zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Florian Bruns, Sigrid Knust, N. V. Shakhlevich

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2015.09.036

zbMATH Keywords

complexitystackingstacking constraintsstorage loading

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Solution approaches for storage loading problems with stacking constraints
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• On the complexity of container stowage planning problems
• MIP-based approaches for robust storage loading problems with stacking constraints
• The parallel stack loading problem to minimize blockages

Cites work

• A constraint programming model for fast optimal stowage of container vessel bays
• A mathematical formulation and complexity considerations for the blocks relocation problem
• Advanced methods for container stacking
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Container ship stowage problem complexity and connection to the coloring of circle graphs
• Deriving decision rules to locate export containers in container yards
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Online rules for container stacking
• Positioning of loading units in a transshipment yard storage area

Cited in

(14)

• The stack loading and unloading problem
• Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems
• MIP-based approaches for robust storage loading problems with stacking constraints
• Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
• Product packing and stacking under uncertainty: a robust approach
• Solution approaches for storage loading problems with stacking constraints
• The gain of robustness for a storage loading problem
• Smart stacking for import containers using customer information at automated container terminals
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Robust storage loading problems with stacking and payload constraints
• Solutions to Real-World Instances of PSPACE-Complete Stacking
• Optimizing the number of deployed yard cranes in a container terminal
• The parallel stack loading problem of minimizing the exact number of relocations
• The parallel stack loading problem: polynomial solvability in the unlimited-capacity case and exact approaches for the finite-capacity case

Describes a project that uses

Uses Software

• BRP

This page was built for publication: Complexity results for storage loading problems with stacking constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q321101)