Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/87155
DC FieldValue
dc.titleOrder picking systems : Batching and storage assignment strategies
dc.contributor.authorTang, L.C.
dc.contributor.authorChew, E.-P.
dc.date.accessioned2014-10-07T10:24:53Z
dc.date.available2014-10-07T10:24:53Z
dc.date.issued1997-12
dc.identifier.citationTang, L.C.,Chew, E.-P. (1997-12). Order picking systems : Batching and storage assignment strategies. Computers and Industrial Engineering 33 (3-4) : 817-820. ScholarBank@NUS Repository.
dc.identifier.issn03608352
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/87155
dc.description.abstractWe consider batching and storage allocation strategies in a manual order picking system of small parts which processes high volume of orders. The arrivals of orders are assumed to follow a Poisson process, and the quantity of items in an order is assumed to be independently and identically distributed negative binomial variates. The order picking system is modeled by a two-stage queueing system with batching and picking activities. Bounds and approximate estimates for the mean and variance of the turnover time (total service time) of a batch of orders are derived. The quality of the results is evaluated via simulation. A comparison between uniform and skewed item storage assignment is also presented. The effects of batching and the batch size on the service time are discussed. © 1997 Elsevier Science Ltd.
dc.sourceScopus
dc.subjectOrder-batching
dc.subjectOrder-picking
dc.subjectQueueing system
dc.subjectWarehouse
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.sourcetitleComputers and Industrial Engineering
dc.description.volume33
dc.description.issue3-4
dc.description.page817-820
dc.description.codenCINDD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.