Login / Signup
An optimal and a heuristic algorithm for the single-item retrieval problem in puzzle-based storage systems with multiple escorts.
Altan Yalcin
Achim Koberstein
Kai-Oliver Schocke
Published in:
Int. J. Prod. Res. (2019)
Keyphrases
</>
single item
storage systems
lot sizing
infinite horizon
upper bound
lead time
long run
file system
multi item
dynamic programming
combinatorial auctions
joint replenishment
databases
finite horizon
flash memory
power consumption
objective function