Discrete priority queueing systems (Q1095512)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Discrete priority queueing systems |
scientific article |
Statements
Discrete priority queueing systems (English)
0 references
1987
0 references
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.
0 references
priority systems
0 references
batch arrivals
0 references
Pollaczek-Khinchin formulas
0 references
absolute priority structure
0 references