We consider a perishable inventory system (PIS) in which demands for items arrive according to a Poisson process and items according to a renewal process. Stored items have a deterministic maximum lifetime ‘on the shelf.’ Exploiting a relation between the so-called virtual outdating time (VOT) process of this PIS and the workload process of the $$M/G/1+D$$ queue, we prove a decomposition property of each of these two processes. Subsequently we analyze two generalizations of the above PIS, where the quality of items on the shelf is not constant. In the first one, there are two types of items, with different maximum lifetimes. In the second, the quality of an item gradually deteriorates with age.
We introduce several dynamic models of sources of “posts” publishing them on a “newsfeed” in e.g. some social media. All of them have a product-form stationary distribution. We define four metrics relevant to these newsfeeds and compute...
We study a restricted version of the Erlang-R queueing model that has both server and space constraints, in which the space restriction is administered by two types of admission policies: blocking or holding in a pre-entrant queue. This...
Single-server queues with customer abandonment arise in call centers and other service systems, yet their steady-state performance is analytically tractable only in special cases. We develop Robust Queueing approximations for the mean...
Semimartingale reflecting Brownian motions (SRBMs) are an integral part of queueing theory. Fluid paths are a standard tool for demonstrating positive recurrence of SRBMs, and their convergence provides both necessary and sufficient...
We study a non-stationary state-dependent Hawkes single-server queueing model with both time-varying arrival and service rates, under the first-come first-served discipline. The arrival process is a Hawkes process with a time-varying...