The travel time in carousel systems under the nearest item heuristic (Q2731149)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The travel time in carousel systems under the nearest item heuristic |
scientific article; zbMATH DE number 1625606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The travel time in carousel systems under the nearest item heuristic |
scientific article; zbMATH DE number 1625606 |
Statements
The travel time in carousel systems under the nearest item heuristic (English)
0 references
22 July 2002
0 references
carousel system
0 references
order picking
0 references
uniform order statistics
0 references
spacings
0 references
memory-less property
0 references
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.
0 references
0.908864676952362
0 references
0.8583762645721436
0 references
0.7949613332748413
0 references
0.7828496694564819
0 references
0.7727488279342651
0 references
