Bruns, F, Knust, S and Chakhlevitch, N (2016) Complexity results for storage loading problems with stacking constraints. European Journal of Operational Research, 249 (3). pp. 1074-1081. ISSN 0377-2217
Abstract
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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). |
Keywords: | Storage loading; Stacking; Complexity; Stacking constraints |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/K041274/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 29 Oct 2015 16:24 |
Last Modified: | 12 Feb 2019 13:50 |
Published Version: | http://dx.doi.org/10.1016/j.ejor.2015.09.036 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.ejor.2015.09.036 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:91278 |