A survey on performance analysis of warehouse carousel systems
From MaRDI portal
Publication:6573281
Cites work
- scientific article; zbMATH DE number 2127961 (Why is no real title available?)
- scientific article; zbMATH DE number 3135325 (Why is no real title available?)
- scientific article; zbMATH DE number 3136250 (Why is no real title available?)
- scientific article; zbMATH DE number 3174015 (Why is no real title available?)
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 1193442 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 28608 (Why is no real title available?)
- scientific article; zbMATH DE number 193562 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 472932 (Why is no real title available?)
- scientific article; zbMATH DE number 1163909 (Why is no real title available?)
- scientific article; zbMATH DE number 1936532 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- scientific article; zbMATH DE number 1855683 (Why is no real title available?)
- scientific article; zbMATH DE number 845723 (Why is no real title available?)
- scientific article; zbMATH DE number 3233336 (Why is no real title available?)
- scientific article; zbMATH DE number 3293521 (Why is no real title available?)
- scientific article; zbMATH DE number 3326216 (Why is no real title available?)
- scientific article; zbMATH DE number 3371431 (Why is no real title available?)
- scientific article; zbMATH DE number 3072483 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- A Lindley-type equation arising from a carousel problem
- A Markovian analysis of additive-increase multiplicative-decrease algorithms
- A general estimation method using spacings
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- A log log law for maximal uniform spacings
- A non-increasing Lindley-type equation
- A note on ``a simple heuristic for maximizing service of carousel storage
- A probabilistic analysis of some tree algorithms
- A revised proof of optimality for the cube-per-order index rule for stored item location
- A simple heuristic for maximizing service of carousel storage
- A two-carousel storage location problem
- A two-station queue with dependent preparation and service times
- AIMD algorithms and exponential functionals
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- An alternating service problem
- Analysis of polling systems with mixed service disciplines
- Applied Probability and Queues
- Assignment Problems and the Location of Economic Activities
- Carousel system performance
- Content of the frustum of a simplex
- Continuity properties and infinite divisibility of stationary distributions of some generalized Ornstein-Uhlenbeck processes
- Distribution of linear combination of exponential variates
- Exact and inexact solution procedures for the order picking in an automated carousal conveyor
- Exact solution to a Lindley-type equation on a bounded support
- Exponential functional of a new family of Lévy processes and self-similar continuous state branching processes with immigration
- Exponential functionals of Lévy processes
- Glivenko-Cantelli-type theorems for weighted empirical distribution functions based on uniform spacings
- Improved algorithm for maximizing service of carousel storage
- Iterative approximation of \(k\)-limited polling systems
- Laws of the iterated logarithm for order statistics of uniform spacings
- Maximizing service of carousel storage
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- Monotone Stochastic Recursions and their Duals
- Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem
- Multivariate spacings based on data depth. I: Construction of nonparametric multivariate tolerance regions
- On Approximate Computer System Models
- On a class of order pick strategies in paternosters
- On distribution tail of the maximum of a random walk
- On powerful distributional tests based on sample spacings
- On queues with service and interarrival times depending on waiting times
- On the asymptotic behavior of some algorithms
- On the asymptotic distribution of k-spacings with applications to goodness-of-fit tests
- On the entire moments of self-similar Markov processes and exponential functionals of Lévy processes
- On the minimal travel time needed to collect \(n\) items on a circle.
- Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage
- Optimal retrieval strategies for carousel conveyors
- Optimal storage locations in a carousel storage and retrieval system
- Order picking in carusel systems under the nearest item heuristic
- PICKING CLUMPY ORDERS ON A CAROUSEL
- Performance of carousel systems with ‘organ-pipe’ storage
- Poisson approximations for the distribution and moments of ordered m-spacings
- Queues where customers of one queue act as servers of the other queue
- Some peculiarities of exponential random variables
- Stochastic ordering and dependence in applied probability
- Storage space allocation to maximize inter-replenishment times
- Strong bounds for weighted empirical distribution functions based on uniform spacings
- Strong laws for the maximal k-spacing when k?c log n
- Strong limiting bounds for maximal uniform spacings
- The Organ Pipe Permutation
- The empirical distribution function and strong laws for functions of order statistics of uniform spacings
- The serial correlation coefficients of waiting times in a stationary single server queue
- The stochastic rendezvous network model for performance of synchronous client-server-like distributed software
- The travel time in carousel systems under the nearest item heuristic
- Time-Dependent Behaviour of an Alternating Service Queue
- Two Queues with Alternating Service
This page was built for publication: A survey on performance analysis of warehouse carousel systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573281)