Discrete priority queueing systems
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.
scientific article; zbMATH DE number 4028590