The travel time in carousel systems under the nearest item heuristic
type: Item
instance of: scholarly article
title: The travel time in carousel systems under the nearest item heuristic
zbMATH Open document ID: 0989.60024
author: Nelly Litvak
author: Ivo Adan
published in: Journal of Applied Probability
publication date: 2002-07-22T00:00:00Z
Mathematics Subject Classification ID: 60E99
Mathematics Subject Classification ID: 90B99
zbMATH DE Number: 1625606
zbMATH Keywords: carousel system
zbMATH Keywords: order picking
zbMATH Keywords: uniform order statistics
zbMATH Keywords: spacings
zbMATH Keywords: memory-less property
MaRDI profile type: Publication
OpenAlex ID: W2085034449
DOI: 10.1239/JAP/996986642
review text: A carousel is an automated warehousing system consisting of a large number of drawers rotating in a closed loop in either direction. The authors deal with the travel time needed to pick a list of \(n\) items when the carousel operates under the nearest item heuristic. Using probabilistic arguments based on properties of uniform order statistics, they derive closed form expressions for the distribution and moments of the travel time. The asymptotic behaviour of the travel time when \(n\) tends to infinity is also investigated.
reviewed by: S. Kalpakam
description: scientific article; zbMATH DE number 1625606