Pages that link to "Item:Q2731149"
From MaRDI portal
The following pages link to The travel time in carousel systems under the nearest item heuristic (Q2731149):
Displayed 12 items.
- Statistical inference for generalized Ornstein-Uhlenbeck processes (Q887250) (← links)
- Order batching in an automated warehouse with several vertical lift modules: optimization and experiments with real data (Q1754274) (← links)
- Stability of a spatial polling system with greedy myopic service (Q1761787) (← links)
- Approximation by \(B\)-spline convolution operators. A probabilistic approach (Q1765456) (← links)
- On a class of order pick strategies in paternosters (Q1870015) (← links)
- On the minimal travel time needed to collect \(n\) items on a circle. (Q1879896) (← links)
- Greedy walk on the real line (Q2352757) (← links)
- A non-increasing Lindley-type equation (Q2641955) (← links)
- Exact and inexact solution procedures for the order picking in an automated carousal conveyor (Q3533209) (← links)
- A Lindley-type equation arising from a carousel problem (Q4660540) (← links)
- A two-sided picking model of M-AS/RS with an aisle-assignment algorithm (Q5438686) (← links)
- Performance of carousel systems with ‘organ-pipe’ storage (Q5478801) (← links)