A LINDLEY-TYPE EQUATION ARISING FROM A CAROUSEL PROBLEM

In this paper we consider a system with two carousels operated by one picker. The items to be picked are randomly located on the carousels and the pick times follow a phase-type distribution. The picker alternates between the two carousels, picking one item at a time. Important performance characteristics are the waiting time of the picker and the throughput of the two carousels. The waiting time of the picker satisfies an equation very similar to Lindley's equation for the waiting time in the PH/U/1 queue. Although the latter equation has no simple solution, we show that the one for the waiting time of the picker can be solved explicitly. Furthermore, it is well known that the mean waiting time in the PH/U/1 queue depends on the complete interarrival time distribution, but numerical results show that, for the carousel system, the mean waiting time and throughput are rather insensitive to the pick-time distribution.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Jeroen P. van den Berg.  Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem , 1996 .

[3]  D. V. Lindley,et al.  The theory of queues with a single server , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  Onno Boxma,et al.  Throughput analysis of two carousels , 2003 .

[5]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[6]  Jay B. Ghosh,et al.  Optimal retrieval strategies for carousel conveyors , 1992 .

[7]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[8]  John J. Bartholdi,et al.  Retrieval Strategies for a Carousel Conveyor , 1986 .

[9]  Casey A. Volino,et al.  A First Course in Stochastic Models , 2005, Technometrics.

[10]  Byung Chun Park,et al.  Carousel system performance , 2003, Journal of Applied Probability.

[11]  Nelly Litvak,et al.  The travel time in carousel systems under the nearest item heuristic , 2001, Journal of Applied Probability.

[12]  Nelly Litvak,et al.  Order picking in carousel systems under the nearest item heuristic , 2000 .

[13]  Hark Hwang,et al.  Class-based storage assignment policy in carousel system , 1994 .

[14]  Ronald W. Wolff,et al.  PICKING CLUMPY ORDERS ON A CAROUSEL , 2004, Probability in the Engineering and Informational Sciences.

[15]  David Pokrass Jacobs,et al.  A simple heuristic for maximizing service of carousel storage , 2000, Comput. Oper. Res..

[16]  Geert-Jan van Houtum,et al.  Performance analysis of a carousel system , 1996 .

[17]  Henk C. Tijms,et al.  A First Course in Stochastic Models: Tijms/Stochastic Models , 2003 .

[18]  Elkafi Hassini,et al.  A two-carousel storage location problem , 2003, Comput. Oper. Res..