The DOI matches its Crossref record; the references it cites are not checked yet.
Robust storage assignment in stack- and queue-based storage systems
Abstract
Abstract In stack- and queue-based storage systems, items stored behind the foremost position are only accessible once all blocking items have been removed. A prominent example are deep-lane storage systems, which are often applied in the refrigerated warehouses of the food industry. The price for the high space utilization of these compact storage systems is, thus, a larger retrieval effort whenever items are not properly stored according to increasing due dates. Due dates, however, are often bound to uncertainties, e.g., due to untimely arrivals of the outbound vehicles picking up the stored items. This paper introduces a new way to derive robust storage assignments, such that excessive retrieval effort is avoided in spite of due date uncertainty. Specifically, we aim to maximize the minimum time difference between due dates of items dedicated to different vehicles and stored in the same stack or queue. The resulting optimization problem is defined, computational complexity is proven, and suited solution procedures are derived. Furthermore, a simulation study investigates whether our novel storage assignments are indeed more robust against unforeseen delays than previous approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
The citation lists are queued
They are fetched later and appear here then.
References 39 · Cited by 16
Research works printed but not linked: 33
- Aytug, 2005, Executing production schedules in the face of uncertainties: a review and some future directions, Eur. J. Oper. Res., 161, 86, 10.1016/j.ejor.2003.08.027 · doi:10.1016/j.ejor.2003.08.027
- Ben-Tal, 2002, Robust optimization methodology and applications, Math. Program. Ser. B, 92, 453, 10.1007/s101070100286 · DOI · Paper page
- Ben-Tal, 2008, Selected topics in robust convex optimization, Math. Program. Ser. B, 112, 125, 10.1007/s10107-006-0092-2 · doi:10.1007/s10107-006-0092-2
- Blasum, 1999, Scheduling trams in the morning, Math. Methods Oper. Res., 49, 137, 10.1007/PL00020912 · doi:10.1007/pl00020912
- Borgman, 2010, Online rules for container stacking, OR Spectr., 32, 687, 10.1007/s00291-010-0205-4 · doi:10.1007/s00291-010-0205-4
- Bortfeldt, 2013, Constraints in container loading - a state-of-the-art review, Eur. J. Oper. Res., 229, 1, 10.1016/j.ejor.2012.12.006 · doi:10.1016/j.ejor.2012.12.006
- Boysen, 2018, Deep-lane storage of time-critical items: one-sided vs. two-sided access, OR Spectr, 10.1007/s00291-017-0488-9 · doi:10.1007/s00291-017-0488-9
- Boysen, 2012, Shunting yard operations: theoretical aspects and applications, Eur. J. Oper. Res., 220, 1, 10.1016/j.ejor.2012.01.043 · doi:10.1016/j.ejor.2012.01.043
- Briskorn, 2011, Robust scheduling on a single machine using time buffers, IIE Trans., 43, 383, 10.1080/0740817X.2010.505123 · doi:10.1080/0740817x.2010.505123
- Carlo, 2014, Storage yard operations in container terminals: literature overview, trends, and research directions, Eur. J. Oper. Res., 235, 412, 10.1016/j.ejor.2013.10.054 · doi:10.1016/j.ejor.2013.10.054
- Chen, 2015, A bi-directional flow-rack automated storage and retrieval system for unit-load warehouses, Int. J. Prod. Res., 53, 4176, 10.1080/00207543.2014.980459 · doi:10.1080/00207543.2014.980459
- Dekker, 2006, Advanced methods for container stacking, OR Spectr., 28, 563, 10.1007/s00291-006-0038-3 · doi:10.1007/s00291-006-0038-3
- Freling, 2005, Shunting of passenger train units in a railway station, Transp. Sci., 39, 261, 10.1287/trsc.1030.0076 · doi:10.1287/trsc.1030.0076
- Gharehgozli, 2014, A decision-tree stacking heuristic minimising the expected number of reshuffles at a container terminal, Int. J. Prod. Res., 52, 2592, 10.1080/00207543.2013.861618 · doi:10.1080/00207543.2013.861618
- Goerigk, 2016, Robust storage loading problems with stacking and payload constraints, Eur. J. Oper. Res., 253, 51, 10.1016/j.ejor.2016.02.019 · doi:10.1016/j.ejor.2016.02.019
- Herroelen, 2004, Robust and reactive project scheduling: a review and classification of procedures, Int. J. Prod. Res., 42, 1599, 10.1080/00207540310001638055 · doi:10.1080/00207540310001638055
- Jacobsen, 2011, Train shunting at a workshop area, Flex. Serv. Manuf. J., 23, 156, 10.1007/s10696-011-9096-1 · doi:10.1007/s10696-011-9096-1
- Kang, 2006, Deriving stacking strategies for export containers with uncertain weight information, J. Intell. Manuf., 17, 399, 10.1007/s10845-005-0013-x · DOI
- Kim, 2000, Deriving decision rules to locate export containers in container yards, Eur. J. Oper. Res., 124, 89, 10.1016/S0377-2217(99)00116-2 · doi:10.1016/s0377-2217(99)00116-2
- Kolen, 2007, Interval scheduling: a survey, Nav. Res. Logist., 54, 530, 10.1002/nav.20231 · DOI · Paper page
- Kouvelis, 1997, 10.1007/978-1-4757-2620-6 · DOI · Paper page
- Le, 2017, MIP-Based approaches for robust storage loading problems with stacking constraints, Comput. Oper. Res., 78, 138, 10.1016/j.cor.2016.08.016 · doi:10.1016/j.cor.2016.08.016
- Lehnfeld, 2014, Loading, unloading and premarshalling of stacks in storage areas: survey and classification, Eur. J. Oper. Res., 239, 297, 10.1016/j.ejor.2014.03.011 · doi:10.1016/j.ejor.2014.03.011
- Leus, 2007, Scheduling for stability in single-machine production systems, J. Sched., 10, 223, 10.1007/s10951-007-0014-z · doi:10.1007/s10951-007-0014-z
- Nishi, 2010, An optimisation model and its effective beam search heuristics for floor-storage warehousing systems, Int. J. Prod. Res., 48, 1947, 10.1080/00207540802603767 · doi:10.1080/00207540802603767
- Stadtler, 1996, An operational planning concept for deep lane storage systems, Prod. Oper. Manag., 5, 266, 10.1111/j.1937-5956.1996.tb00398.x · doi:10.1111/j.1937-5956.1996.tb00398.x
- Steenken, 2004, Container terminal operation and operations research - a classification and literature review, OR Spectr., 26, 3, 10.1007/s00291-003-0157-z · doi:10.1007/s00291-003-0157-z
- Tang, 2012, Models and algorithms for shuffling problems in steel plants, Nav. Res. Logist., 59, 502, 10.1002/nav.21503 · doi:10.1002/nav.21503
- Van de Vonder, 2005, The use of buffers in project management: the trade-off between stability and makespan, Int. J. Prod. Econ., 97, 227, 10.1016/j.ijpe.2004.08.004 · DOI
- Winter, 2000, Real-time dispatch of trams in storage yards, Ann. Oper. Res., 96, 287, 10.1023/A:1018907720194 · doi:10.1023/a:1018907720194
- Zaerpour, 2015, Storing fresh produce for fast retrieval in an automated compact cross-dock system, Prod. Oper. Manag., 24, 1266, 10.1111/poms.12321 · doi:10.1111/poms.12321
- Zäpfel, 2006, Warehouse sequencing in the steel supply chain as a generalized job shop model, Int. J. Prod. Econ., 104, 482, 10.1016/j.ijpe.2004.10.005 · doi:10.1016/j.ijpe.2004.10.005
- Zhang, 2010, A note on deriving decision rules to locate export containers in container yards, Eur. J. Oper. Res., 205, 483, 10.1016/j.ejor.2009.12.016 · doi:10.1016/j.ejor.2009.12.016
Metadata
- Authors
- Boywitz, D., & Boysen, N.
- Affiliations
- Friedrich Schiller University Jena (DE)
- Corresponding author
- Boysen, Nils
- ORCID
- Boysen, Nils
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2018-12
- Volume
- 100
- Pages
- 189-200
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2884324317
- Cited by
- 16
- References
- 39
- Citations by year
- 2026: 2 · 2025: 1 · 2024: 2 · 2022: 3 · 2021: 4 · 2020: 2 · 2019: 2
- FWCI
- 1.35
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Computers & Operations Research (publishedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Advanced Manufacturing and Logistics Optimization
- Social Sciences › Decision Sciences › Management Science and Operations Research › Supply Chain and Inventory Management
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Keywords
- storage location assignment, robust optimization, retrieval effort, cold storage facilities, vehicle scheduling, computational complexity, food logistics
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust storage assignment in stack- and queue-based storage systems. https://app.cochat.ai/papers/10.1016/j.cor.2018.07.014
- The paper
- Boywitz, D., & Boysen, N. (2018). Robust storage assignment in stack- and queue-based storage systems. Computers & Operations Research. https://doi.org/10.1016/j.cor.2018.07.014
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
