Optimizing the storage assignment in a warehouse served by milkrun logistics

András Kovács

International Journal of Production Economics, 2011, vol. 133, issue 1, 312-318

Abstract: This paper addresses the problem of storage assignment in a warehouse characterized by multi-command picking and served by milkrun logistics. In such a logistic system, vehicles circulate between the warehouse and the production facilities of the plant according to a pre-defined schedule, often with multiple cycles (routes) serving different departments. We assume that a request probability can be assigned to each item and each cycle, which leads to a special case of the correlated storage assignment problem. A MIP model is proposed for finding a class-based storage policy that minimizes the order cycle time, the average picking effort, or a linear combination of these two criteria. Computational experiments show that our approach can achieve an up to 36-38% improvement in either criterion compared to the classical COI-based strategy.

Keywords: Storage; assignment; Correlated; Warehousing; Milkrun; Mixed-integer; programming (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527310000319
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:133:y:2011:i:1:p:312-318

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().