Optimal retrieval strategies for carousel conveyors

DOI10.1016/0895-7177(92)90060-XzbMATH Open0782.90031OpenAlexW2004604538MaRDI QIDQ1206145FDOQ1206145

Authors: Jay B. Ghosh, Charles Wells 

Publication date: 1 April 1993

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(92)90060-x

Recommendations

• Exact and inexact solution procedures for the order picking in an automated carousal conveyor
• Order picking optimization in carousels storage system
• Optimal storage locations in a carousel storage and retrieval system
• Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem
• Maximizing service of carousel storage

zbMATH Keywords

carousel conveyoroptimal retrievalsingle and multiple orders

Mathematics Subject Classification ID

Dynamic programming (90C39) Inventory, storage, reservoirs (90B05)

Cites Work

• Title not available (Why is that?)

Cited In (11)

• A Lindley-type equation arising from a carousel problem
• A survey on performance analysis of warehouse carousel systems
• Maximizing service of carousel storage
• Design and storage cycle time analysis for the automated storage system with a conveyor and a rotary rack
• Research on warehouse operation: a comprehensive review
• Pick sequencing optimization problem in the rotary rack S/R system
• Order picking optimization in carousels storage system
• A polynomial time algorithm for unloading boxes off a gravity conveyor
• Exact and inexact solution procedures for the order picking in an automated carousal conveyor
• The Efficiency of Two Groups of N Machines Served by a Single Robot
• Optimal retrieval in puzzle‐based storage with heuristic search and tabulation

This page was built for publication: Optimal retrieval strategies for carousel conveyors

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