Order picking under random and turnover-based storage policies in fishbone aisle warehouses

Date

2014-03-04

Author

Celik, Melih
Süral, Haldun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

69
views

0
downloads

A recent trend in the layout design of unit-load warehouses is the application of layouts without conventional parallel pick aisles and straight middle aisles. Two examples for such designs are flying-V and fishbone designs for single- and dual-command operations. In this study, it is shown that the multi-item order picking problem can be solved in polynomial time for both fishbone and flying-V layouts. These two designs are compared with the traditional parallel-aisle design under the case of multi-item pick lists. Simple heuristics are proposed for fishbone layouts that are inspired by those put forward for parallel-aisle warehouses and it is experimentally shown that a modification of the aisle-by-aisle heuristic produces good results compared with other modified S-shape and largest gap heuristics when items have uniform demand. Computational experiments are performed in order to compare the performances of fishbone and traditional layouts under optimal routing and it is shown that a fishbone design can obtain improvements of around 20% over parallel-aisle design in single-command operations but can perform as high as around 30% worse than an equivalent parallel-aisle layout as the size of the pick list increases. The sensitivity of the results to varying demand skewness levels when volume-based storage is applied is tested and it is shown that unlike the single- and dual-command cases, a fishbone design performs better compared to a traditional design under highly skewed demand as opposed to uniform demand.

Subject Keywords

Industrial and Manufacturing Engineering

URI

https://hdl.handle.net/11511/41358

Journal

IIE TRANSACTIONS

DOI

https://doi.org/10.1080/0740817x.2013.768871

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Generation of patterned indentations for additive manufacturing technologies Yaman, Ulaş; Dölen, Melik; Hoffmann, Christoph (Informa UK Limited, 2019-02-01) This article proposes a novel approach to generate patterned indentations for different additive manufacturing methodologies. Surface textures have many practical applications in various fields, but require special manufacturing considerations. In addition to conventional manufacturing processes, additive processes have also been utilized in the last decade to obtain textured surfaces. The current design and fabrication pipeline of additive manufacturing operations have many disadvantages in that respect. F...
Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates Azizoğlu, Meral (Informa UK Limited, 1997-11-01) We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due window to minimize total weighted earliness and tardiness cost. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. Earliness or tardiness cost is assessed when a job completes outside the due window, which may be an instant in time or a time increment defining acceptable job completion. In this paper we present properties that characterize the structure of an op...
Spatial synthesis by disjunctive constraint satisfaction Baykan, CA; Fox, MS (Cambridge University Press (CUP), 1997-09-01) The spatial synthesis problem addressed in this paper is the configuration of rectangles in 2D space, where the sides of the rectangles are parallel to an orthogonal coordinate system. Variables are the locations of the edges of the rectangles and their orientations. Algebraic constraints on these variables define a layout and constitute a constraint satisfaction problem. We give a new O(n(2)) algorithm for incremental path-consistency, which is applied after adding each algebraic constraint. Problem requir...
Flexible assembly line design problem with fixed number of workstations Barutçuoğlu, Şirin; Azizoğlu, Meral; Department of Industrial Engineering (2009) In this thesis, we study a Flexible Assembly Line Design problem. We assume the task times and equipment costs are correlated in the sense that for all tasks the cheaper equipment gives no smaller task time. Given the cycle time and number of workstations we aim to find the assignment of tasks and equipments to the workstations that minimizes the total equipment cost. We study a special case of the problem with identical task times. For the general case, we develop a branch and bound algorithm that uses pow...
Flexible assembly line design problem with fixed number of workstations Barutcuoglu, Sirin; Azizoğlu, Meral (Informa UK Limited, 2011-01-01) In the paper, we study a flexible assembly line design problem with equipment decisions. We assume the task times and equipment costs are correlated in the sense that for all tasks the cheaper equipment gives no smaller task time. Given the cycle time and number of workstations we aim to find the assignment of tasks and equipment to the workstations so as to minimise the total equipment cost. We develop a branch and bound algorithm that uses powerful lower bounds and reduction mechanisms. Our computational ...

Citation Formats

M. Celik and H. Süral, “Order picking under random and turnover-based storage policies in fishbone aisle warehouses,” IIE TRANSACTIONS, pp. 283–300, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41358.