Abstract:
We propose a model for a servicing system with perishable inventory and a finite queue of impatient claims where the server can be in one of three states: operational, early and delaying vacations. We develop a method for approximate computation of the system's characteristics. We show results of numerical experiments.
Keywords:queueing–inventory systems, perishable inventory, server vacation, computational algorithms, optimization.