In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that t...

Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get service priority over customers which are less delay-sensitive. In this contribution, we analyze a discretetime two-class preemptive repeat identical priority queue with infinite buffer space and generally distributed serv...

This paper considers a discrete-time queue with gated priority. Low priority customers arrive at the first queue at the gate in batches according to a batch Bernoulli process (BBP). When the gate opens, all low priority customers at the first queue move to the second queue at a single server. On the other hand, high priority customers directly join the second queue upon arrival. The arrival pro...

This paper presents formulas for calculating waiting time for customers in a queue with combined preemptive and head-ofline (nonpreemptive) priority scheduling disciplines and describes the reasoning behind them. This work has been applied in the development of programmable terminal control units. Introduction The development of programmable terminal control units has created the need for a new...

An analysis of single server preemptive priority retrial queue with at most J vacations where two types of customers called (priority customers and ordinary customers) are considered in this paper. The priority customers do not have queue and they have higher priority to receive their services over ordinary customers. If negative customer is arriving during the service time of any positive cust...

The paper we present here introduces a new priority mechanism in discrete-time queueing systems. It is a milder form of priority when compared to HoL priority, but it favors customers of one type over the other when compared to regular FCFS. It also provides an answer to the starvation problem that occurs in HoL priority systems. In this new priority mechanism, customers of different priority c...

The present investigation deals with performance analysis of single server preemptive priority retrial queue with immediate Bernoulli feedback. There are two types of customers are considered, which are priority customers and ordinary customers. The priority customers do not form any queue and have an exclusive preemptive priority to receive their services over ordinary customers. After complet...

The referral priority program—an emerging business practice adopted by a growing number of technology companies that manage a waitlist of customers—enables existing customers on the waitlist to gain priority access if they successfully refer new customers to the waitlist. Unlike more commonly used referral reward programs, this novel mechanism does not offer monetary compensation to referring c...

due to the importance of “service quality and customerssatisfaction” subject, this study seeks to investigate and prioritize thefactors which are effective on service quality and customers satisfactionusing grey relational analysis (gra) method. in the case of statisticalpopulations with large sizes, none of the other methods can competewith gra from the viewpoint of calculation accuracy. the s...