A dynamic programming algorithm for the space allocation and aisle positioning problem

The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage loca...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:The Journal of the Operational Research Society Ročník 65; číslo 9; s. 1315 - 1324
Hlavní autori: Bodnar, Peter, Lysgaard, Jens
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Taylor & Francis 01.09.2014
Palgrave Macmillan
Palgrave Macmillan UK
Taylor & Francis Ltd
Predmet:
Algorithms
Business and Management
Dynamic programming
General Paper
General Papers
Graph representations
Gravity
Iterative solutions
Management
Materials handling
Operations research
Operations Research/Decision Theory
Optimal solutions
Order picking
Pallets
product allocation
Product labeling
storage location assignment
Vertices
Warehouses
warehousing
dynamic programming
warehousing
storage location assignment
product allocation
ISSN:0160-5682, 1476-9360
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage locations. In this paper, we develop an exact dynamic programming algorithm for the SAAPP. The computational study shows that our exact algorithm can be used to find optimal solutions for numerous SAAPP instances of moderate size.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-News-1
content type line 14
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.2013.64