A simple heuristic for maximizing service of carousel storage

A simple heuristic for maximizing service of carousel storage

0.00 Avg rating0 Votes
Article ID: iaor20011670
Country: United Kingdom
Volume: 27
Issue: 13
Start Page Number: 1351
End Page Number: 1356
Publication Date: Nov 2000
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics, programming: integer
Abstract:

We consider a system that stores cases of items. Items are removed from storage in groups. A group consists of a certain number of items of each type. The (integer maximization) problem is to determine how many cases of each type should be stored in order to maximize the number of groups of items that can be retrieved without re-loading. We give a simple heuristic that yields a feasible solution whose error can be bounded. Our method takes only linear time.

Reviews

Required fields are marked *. Your email address will not be published.