Discrete priority queueing systems
type: Item
instance of: scholarly article
title: Discrete priority queueing systems
zbMATH Open document ID: 0632.60104
author: V. B. Ivanovskij
published in: Automation and Remote Control
publication date: 1987-01-01T00:00:00Z
review text: A single-server system with infinite waiting room is considered in discrete time. The input is a geometric stream with batch arrivals, the service time distribution is general arithmetic. The author derives Pollaczek-Khinchin formulas for the actual waiting time and the ``unloading time'' of the system (which is not the waiting time of a customer due to the bulk arrivals). Variants which are investigated: different customer types, different customer types with relative or absolute priority structure.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 4028590
zbMATH Keywords: priority systems
zbMATH Keywords: batch arrivals
zbMATH Keywords: Pollaczek-Khinchin formulas
zbMATH Keywords: absolute priority structure
reviewed by: Hans Daduna
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4028590