The travel time in carousel systems under the nearest item heuristic
From MaRDI portal
Publication:2731149
DOI10.1239/jap/996986642zbMath0989.60024OpenAlexW2085034449MaRDI 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
Related Items (13)
On the minimal travel time needed to collect \(n\) items on a circle. ⋮ A non-increasing Lindley-type equation ⋮ Statistical inference for generalized Ornstein-Uhlenbeck processes ⋮ One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations ⋮ Exact and inexact solution procedures for the order picking in an automated carousal conveyor ⋮ Order batching in an automated warehouse with several vertical lift modules: optimization and experiments with real data ⋮ A Lindley-type equation arising from a carousel problem ⋮ Stability of a spatial polling system with greedy myopic service ⋮ Approximation by \(B\)-spline convolution operators. A probabilistic approach ⋮ A two-sided picking model of M-AS/RS with an aisle-assignment algorithm ⋮ Performance of carousel systems with ‘organ-pipe’ storage ⋮ Greedy walk on the real line ⋮ On a class of order pick strategies in paternosters
This page was built for publication: The travel time in carousel systems under the nearest item heuristic
