The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage

Sven Boge and Sigrid Knust

European Journal of Operational Research, 2020, vol. 280, issue 3, 940-952

Abstract: In this paper, we consider the parallel stack loading problem (PSLP) with the objective to minimize the number of reshuffles in the retrieval stage. Since in the PSLP the incoming items have to be stored according to a fixed arrival sequence, some reshuffles cannot be avoided later on. We study two surrogate objective functions (number of unordered stackings, number of badly placed items) to estimate the number of reshuffles and compare them theoretically as well as in a computational study. For this purpose, MIP formulations and a simulated annealing algorithm are proposed.

Keywords: Logistics; Storage loading; Reshuffles; Stacking problems (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221719306587
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:280:y:2020:i:3:p:940-952

DOI: 10.1016/j.ejor.2019.08.005

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().