Asset Details
Do you wish to reserve the book?
Optimizing throughput in multi-aisle automated storage and retrieval systems: a comprehensive analysis of performance under generally distributed fully sequenced orders through merging queuing systems
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Optimizing throughput in multi-aisle automated storage and retrieval systems: a comprehensive analysis of performance under generally distributed fully sequenced orders through merging queuing systems
Do you wish to request the book?
Optimizing throughput in multi-aisle automated storage and retrieval systems: a comprehensive analysis of performance under generally distributed fully sequenced orders through merging queuing systems
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Optimizing throughput in multi-aisle automated storage and retrieval systems: a comprehensive analysis of performance under generally distributed fully sequenced orders through merging queuing systems
2025
Overview
This paper proposes a method to accurately determine the throughput of a multiple-aisle automated storage and retrieval system. The main focus is on the order sequence of the retrieval process from different storage aisles. The process is modeled as a merging process with several inputs, each with limited capacity. A queuing system with finite capacities is used to describe this complex process. Specifically, an M/G/1/K-queuing model is employed for every input stream, and these models are combined to evaluate the performance of different numbers of aisles. A discrete event simulation is used to validate the accuracy of the proposed method. The paper concludes with an example that demonstrates the impact of variables such as the storage aisle throughput, the merging point performance, and its coefficient of variation on the overall performance of the storage aisle. The paper offers a decision tool that can accurately determine the throughput of a multiple-aisle storage system.
Publisher
Taylor & Francis,Taylor & Francis Ltd,Taylor & Francis Group
