Complexity results for storage loading problems with stacking constraints
Autor(en): | Bruns, Florian Knust, Sigrid Shakhlevich, Natalia V. |
Stichwörter: | Business & Economics; Complexity; EXPORT CONTAINERS; Management; Operations Research & Management Science; RULES; Stacking; Stacking constraints; Storage loading; STOWAGE | Erscheinungsdatum: | 2016 | Herausgeber: | ELSEVIER SCIENCE BV | Journal: | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | Volumen: | 249 | Ausgabe: | 3 | Startseite: | 1074 | Seitenende: | 1081 | Zusammenfassung: | In this paper, we present complexity results for storage loading problems where the storage area is organized in fixed stacks with a limited common height. Such problems appear in several practical applications, e.g., in the context of container terminals, container ships or warehouses. Incoming items arriving at a storage area have to be assigned to stacks so that certain constraints are respected (e.g., not every item may be stacked on top of every other item). We study structural properties of the general model and special cases where at most two or three items can be stored in each stack. Besides providing polynomial time algorithms for some of these problems, we establish the boundary to NP-hardness. (C) 2015 The Authors. Published by Elsevier B.V. |
ISSN: | 03772217 | DOI: | 10.1016/j.ejor.2015.09.036 |
Zur Langanzeige
Seitenaufrufe
3
Letzte Woche
0
0
Letzter Monat
1
1
geprüft am 19.05.2024