A heuristic travel time model for random storage systems using closest open location load dispatching

DOI10.1080/00207540601118462MaRDI QIDQ3533192zbMATH OpenOpenAlexFDO

Authors Miki Fukunari, Charles J. Malmborg

Publication date 23 October 2008

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207540601118462

zbMATH Keywords

randomized storageload dispatchingautomated storage and retrieval systemsclosest open location

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• Order batching algorithms and travel-time estimation for automated storage/retrieval systems
• Shuffling heuristics for the storage location assignment in an AS/RS
• Closest open location rule under stochastic demand
• The travel time in carousel systems under the nearest item heuristic
• Travel time analysis for general item location assignment in a rectangular warehouse

Cites work

• New cycle time and space estimation models for automated storage and retrieval system conceptualization
• Storage assignment policy tradeoffs
• Storage-Retrieval Interleaving in Automatic Warehousing Systems
• Warehouse design and control: Framework and literature review

Cited in

(2)

• Closest open location rule under stochastic demand
• Mathematical justification of a heuristic for statistical correlation of real-life time series

This page was built for publication: A heuristic travel time model for random storage systems using closest open location load dispatching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533192)