RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2017 Issue 11, Pages 64–78 (Mi at14924)

This article is cited in 18 papers

Stochastic Systems

Approximate analysis of a queueing–inventory system with early and delayed server vacations

A. Z. Melikova, A. M. Rustamova, L. A. Ponomarenkob

a Institute of Control Systems, Azerbaijan National Academy of Sciences, Baku, Azerbaijan
b International Research and Training Center for Information Technologies and Systems of the National Academy of Sciences of Ukraine, Kiev, Ukraine

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.

Presented by the member of Editorial Board: V. M. Vishnevsky

Received: 24.03.2017


 English version:
Automation and Remote Control, 2017, 78:11, 1991–2003

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025