Abstract
This paper presents a method for obtaining approximate solutions for pick-and-pass order picking systems with multiple classes of orders. The pick-and-pass system is decomposed into an entrance station, conveyor nodes and pick stations. A customer order needs to visit multiple pick stations, but the sequence is not pre-determined. It is possible for a customer order to be blocked if the pick station is fully occupied. A blocked order is recirculated in the network, until it can enter the pick station. Under the assumption of the 'jump-over' blocking protocol it is proved that the product form is retained for this type of networks. An iterative algorithm using mean value analysis (MVA) is developed to evaluate the performance measures and the blocking probability of the order picking system. The accuracy of the algorithm is compared with the results of a discrete event simulation.
Key words: Queuing networks; mean value analysis; warehousing; order picking; pick-and-pass
Original language | English |
---|---|
Title of host publication | Proceedings of the 8th International Conference on Stochastic Models of Manufacturing and Service Operations (SMMSO 2011, Kusadasi, Turkey, May 28-June 2, 2011) |
Pages | 1-10 |
Publication status | Published - 2011 |