We study a service system modelled as a single server queuing system where request for service either can be processed at the service system or by a subcontractor. In the former case the customer is incurred waiting costs but the service is free, while in the latter case the customer must pay...

We study a service system modelled as a single server queuing system where request for service either can be processed at the service system or by a subcontractor. In the former case the customer is incurred waiting costs but the service is free, while in the latter case the customer must pay...

We consider a vendor who supplies goods to a set of geographically dispersed retailers and can monitor and control the inventory levels at the retailers. Such an arrangement is often called vendor managed inventory (VMI). The decisions in this set-up are the inventory levels at the warehouse and...

We develop an algorithm to compute an optimal Q(s,S) policy for the joint replenishment problem when demands follow a compound correlated Poisson process. It is a non-trivial generalization of the work by Nielsen and Larsen [2005. An analytical study of the Q(s,S) policy applied to the joint...

We explore a base-stock system with backlogging where the demand process is a compound renewal process and the compound element is a delayed geometric distribution. For this setting it holds that the long-run average service measures order fill rate (OFR) and volume fill rate (VFR) are equal in...

We study an inventory system controlled by a base stock policy assuming a compound renewal demand process. We extend the base stock policy by incorporating rules for degrading the service of larger orders. Two specific rules are considered, denoted as Postpone(q,t) and Split(q), respectively....