Shuffling heuristics for the storage location assignment in an AS/RS

DOI10.1080/00207549508930234zbMath0917.90111OpenAlexW2091707684WikidataQ126250571 ScholiaQ126250571MaRDI QIDQ4399000

Richard J. Linn, Ram Pandit, Balaji Muralidharan

Publication date: 18 July 1999

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

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

zbMATH Keywords

automated storage retrieval systemstorage location assignment

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (4)

Research on warehouse operation: a comprehensive review ⋮ Product location, allocation and server home base location for an order picking line with multiple servers. ⋮ A survey of literature on automated storage and retrieval systems ⋮ Warehouse design and control: Framework and literature review

Cites Work

• The selective travelling salesman problem
• Facet identification for the symmetric traveling salesman polytope
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• The traveling salesman problem: An update of research
• Approximate Traveling Salesman Algorithms
• A restricted Lagrangean approach to the traveling salesman problem
• Optimal Storage Assignment in Automatic Warehousing Systems
• Storage-Retrieval Interleaving in Automatic Warehousing Systems

This page was built for publication: Shuffling heuristics for the storage location assignment in an AS/RS