![Improved algorithm for maximizing service of carousel storage [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR7R9I.jpg)
Improved algorithm for maximizing service of carousel storage [An article from: Computers and Operations Research]
Book Details
Author(s)C.-L. Li, G. Wan
PublisherElsevier
ISBN / ASINB000RR7R9I
ISBN-13978B000RR7R94
AvailabilityAvailable for download now
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
We consider a problem of maximizing the service of a carousel storage system from which items are removed in groups, where each group consists of a certain given number of items of each type. Kim (Comput. Oper. Res., forthcoming) has developed an algorithm for solving this problem with a running time of O(j^2). In this article, we present an algorithm with an improved complexity of O(jlogj).
Description:
We consider a problem of maximizing the service of a carousel storage system from which items are removed in groups, where each group consists of a certain given number of items of each type. Kim (Comput. Oper. Res., forthcoming) has developed an algorithm for solving this problem with a running time of O(j^2). In this article, we present an algorithm with an improved complexity of O(jlogj).
