We provide a novel approach to characterize the order process of continuous review (s,S) and (r,nQ) inventory policies, and study the impact of the batching parameter (the value of Q or S-s) on the variability in the order process. First, we characterize the distribution of the time between...

We consider a supply chain in which orders and lead times are linked endogenously, as opposed to assuming lead times are exogenous. This assumption is relevant when a retailer’s orders are produced by a supplier with finite capacity and replenished when the order is completed. The retailer...

In this paper, we describe a link between Markovian binary trees (MBT) and tree-like quasi-birth-and-death processes (TLQBD) by associating a specific TLQBD to each MBT. The algorithms to compute the matrices Gk in the TLQBD then correspond to the algorithms calculating the extinction...

In this paper we introduce the adaptive MMAP[K] arrival process and analyze the adaptive MMAP[K]/PH[K]/1 queue. In such a queueing system, customers of K different types with Markovian inter-arrival times and possibly correlated customer types, are fed to a single server queue that makes use of...

We present a model for assigning server time slots to different classes of patients. The objective is to minimize the total expected weighted waiting time of a patient (where different patient classes may be assigned different weights). A bulk service queueing model is used to obtain the...