Storage space allocation to maximize inter-replenishment times

DOI10.1016/j.cor.2006.09.023zbMath1180.90168OpenAlexW2024844414MaRDI QIDQ2468476

Elkafi Hassini

Publication date: 23 January 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.09.023

zbMATH Keywords

stochastic demand

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (1)

A Benders decomposition approach to product location in carousel storage systems

Cites Work

• Unnamed Item
• Maximizing service of carousel storage
• A representation for multinomial cumulative distribution functions
• Optimal allocation of storage space
• A simple heuristic for maximizing service of carousel storage
• A note on ``a simple heuristic for maximizing service of carousel storage
• Comments on a note by Jacobs, Peck and Davis
• A Max-Min Allocation Problem: Its Solutions and Applications

This page was built for publication: Storage space allocation to maximize inter-replenishment times