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.
ABSTRACT
PUBLICATION RECORD
- Publication year
2020
- Venue
European Journal of Operational Research
- Publication date
2020-02-01
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-16 of 16 references · Page 1 of 1
CITED BY
Showing 1-26 of 26 citing papers · Page 1 of 1