The travel time in carousel systems under the nearest item heuristic

DOI10.1239/jap/996986642zbMath0989.60024MaRDI QIDQ2731149

Nelly Litvak, Ivo J. B. F. Adan

Publication date: 22 July 2002

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/afdc0e26eb5010d83b3c27d0ec0d33f8ece52e9e

zbMATH Keywords

spacings; order picking; uniform order statistics; carousel system; memory-less property

Mathematics Subject Classification ID

90B99: Operations research and management science

60E99: Distribution theory

Related Items

A Lindley-type equation arising from a carousel problem, A two-sided picking model of M-AS/RS with an aisle-assignment algorithm, Performance of carousel systems with ‘organ-pipe’ storage, One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations, Statistical inference for generalized Ornstein-Uhlenbeck processes, Order batching in an automated warehouse with several vertical lift modules: optimization and experiments with real data, Stability of a spatial polling system with greedy myopic service, Approximation by \(B\)-spline convolution operators. A probabilistic approach, On a class of order pick strategies in paternosters, On the minimal travel time needed to collect \(n\) items on a circle., Greedy walk on the real line, A non-increasing Lindley-type equation, Exact and inexact solution procedures for the order picking in an automated carousal conveyor