Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Maximizing service of carousel storage

From MaRDI portal
Publication:706988
Jump to:navigation, search

DOI10.1016/J.COR.2003.08.016zbMath1071.90049OpenAlexW2018880995MaRDI QIDQ706988

Bara Kim

Publication date: 9 February 2005

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

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


zbMATH Keywords

Optimal solutionCarousel storage problem


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)


Related Items (2)

Improved algorithm for maximizing service of carousel storage ⋮ Storage space allocation to maximize inter-replenishment times




Cites Work

  • A simple heuristic for maximizing service of carousel storage
  • A note on ``a simple heuristic for maximizing service of carousel storage




This page was built for publication: Maximizing service of carousel storage

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:706988&oldid=12614461"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 09:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki