相关论文: Exact results for the order picking time distribut…
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we…
We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and service time of…
Consider a regenerative storage process with a nondecreasing L\'evy input (subordinator) such that every cycle may be split into two periods. In the first (off) the output is shut off and the workload accumulates. This continues until some…
We consider a polling system: a queueing system of $N\ge 1$ queues with Poisson arrivals $Q_1,...,Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating…
E-commerce operations are essentially online, with customer orders arriving dynamically. However, very little is known about the performance of online policies for warehousing with respect to optimality, particularly for order picking and…
This note aims to verify a Laplace transform pair, previously published without proof, concerning the expected stock-out that may occur in a production-inventory systems when demand is Poisson, and the time horizon is finite. Stock-out, or…
The standard single picker routing problem (SPRP) seeks the cost-minimal tour to collect a set of given articles in a rectangular single-block warehouse with parallel picking aisles and a dedicated storage policy, i.e, each SKU is only…
We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the…
Storage allocation affects important performance measures of distributed storage systems. Most previous studies on the storage allocation consider its effect separately either on the success of the data recovery or on the service rate…
The Laplace transform is a widely used tool in the study of probability distributions, often allowing for a probability density functions and distribution functions simpler determination and being a moments generating function. In this…
We study flow shop scheduling with stochastic reentry, where jobs must complete multiple passes through the entire shop, and the number of passes that a job requires for completion is drawn from a discrete probability distribution. The goal…
Order picking is the single most cost-intensive activity in picker-to-parts warehouses, and as such has garnered large interest from the scientific community which led to multiple problem formulations and a plethora of algorithms published.…
We consider an orienteering problem (OP) where an agent needs to visit a series (possibly a subset) of depots, from which the maximal accumulated profits are desired within given limited time budget. Different from most existing works where…
The purpose of this work is to find the time dependent distributions of directions and positions of a particle that undergoes multiple elastic scattering. The angular cross section is given and the scatterers are randomly placed. The…
We study random packings of $2\times2$ squares with centers on the square lattice $\mathbb{Z}^{2}$, in which the probability of a packing is proportional to $\lambda$ to the number of squares. We prove that for large $\lambda$, typical…
An analytical study of the return time distribution of extreme events for stochastic processes with power-law correlation has been carried on. The calculation is based on an epsilon-expansion in the correlation exponent:…
In picker-to-parts warehouses, order picking is a cost- and labor-intensive operation that must be designed efficiently. It comprises the construction of order batches and the associated order picker routes, and the assignment and…
This paper addresses the two-stocking locations single item non-stationary stochastic lot-sizing problem. The inventory level at each location is reviewed periodically. Items can be reordered and received from a common central warehouse and…
The paper presents some distributional properties of logistic order statistics subject to independent exponential one-sided and two-sided shifts. Utilizing these properties, we extend several known results and obtain some new…
This paper addresses the single-item single-stocking location non-stationary stochastic lot-sizing problem under a reorder point -- order quantity control strategy. The reorder points and order quantities are chosen at the beginning of the…