1,948
Views
1
CrossRef citations to date
0
Altmetric
Research Article

The difference of mean waiting times between two classes of customers in a single-server FIFO queue: An experimental study

ORCID Icon & | (Reviewing Editor)
Article: 1321082 | Received 23 Feb 2017, Accepted 16 Apr 2017, Published online: 26 Apr 2017

Abstract

Previous studies have shown that the distribution of mean waiting times of different classes of customers is different for each class in a GI/G/1 queue with FIFO discipline. This experimental simulation study is motivated by those results as it investigates which are the conditions causing a difference of mean waiting times between two classes of customers using a FIFO discipline. Results from the study show that having a difference in the squared coefficient of variation of inter-arrival times between classes is the most important factor to determine whether a difference of mean waiting times between two classes exists. Furthermore, if a difference of mean service times between the two classes exists, the class with the highest mean service time will tend to have the smallest mean waiting time between the two classes, resulting in an unfair policy.

Public Interest Statement

The common assumption in any service or production facility is that the FIFO discipline is one of the fairest service disciplines since serving customers in the order of arrival will result in an equal expected queueing time for all types of customers, contrary to a priority-based service. However, this study presents some results that challenge that assumption when some particular probabilistic conditions exist. Firstly, we found that the type of customers with the highest variance between consecutive arrivals were the customers with the highest average queueing times. Secondly, results showed that the type of customers that needed more service time were the customers with the lowest queueing time, a result that would seem particularly unfair for the customers with lower service time needs.

1. Introduction

Multi-class queueing systems are used to represent systems where inter-arrival and service processes cannot be modelled by a single probability function because different types of customers with different behaviours arrive to the server facilities in order to be processed.

Due to the importance of the topic of multi-class queueing systems to the practice of Operations Management (OM), this topic has been extensively studied; see, for example, the books by Jaiswal (Citation1968), Bolch, Greiner, de Meer, and Trivedi (Citation1998) and Gross, Shortie, Thompson, and Harris (Citation2008) for a summary of results of multi-class queueing systems and priority queueing.

One of the most practical and well-known results concerned with multi-class queueing systems is that the customers with the highest priority in a M/G/1 queue have the lowest mean waiting time, compared with the other customers (Sztrik, Citation2016). Conversely, the lowest priority customers have the highest mean waiting time of all the customers. Furthermore, for any multi-class M/G/1 queueing system without priorities and a FIFO service discipline, all classes of customers have the same waiting time distribution (Boxma & Takine, Citation2003), even if the arrival and service rates are different among customer classes.

However, some contrasting results can be found in the studies by Van Houdt and Blondia (Citation2002) and He (Citation2012), where it was shown that, for multi-class single server queues with non-Poissonian arrivals and FIFO discipline, the steady-state probability distributions of the waiting times of different classes were different.

In particular, He (Citation2012) showed an example of a two-class GI/G/1 system, with batch arrivals and with different arrival and service rates for each class, where the class with the highest arrival rate and the highest service rate (or the quickest service time) was the class with the highest mean waiting time.

These results are somewhat counter-intuitive as it would be expected that any priority discipline for ordering queues would be fair with the customers with the lowest mean service times by a resulting low mean waiting time (Wierman, Citation2011) or at least that the FIFO discipline would provide an equal and fair service for all the customers (Avi-Itzhak & Levy, Citation2004), regardless of class characteristics.

Thus, we think that the topic of the difference of mean waiting times among different customer classes is worth further investigation as various subjects regarding the difference of mean waiting times are yet to be studied. The objective of this paper can be summarised in the following research statements that will be investigated:

(1)

A difference of steady-state mean waiting times between two distinct classes of customers commonly exists on a GI/G/1/FIFO queueing system.

(2)

The difference of mean waiting times between two classes is only present in systems where the SCV of inter-arrival times is different from 1 as there is no difference of mean waiting times between two classes with different arrival and service rates in an M/G/1 system, where the Squared Coefficient of Variation (SCV) of inter-arrival times is 1.

(3)

The difference of mean waiting times between two classes is caused by a difference on the utilisation that each class creates on the system, independently of the differences between mean arrival and service rates.

Therefore, this paper is concerned with investigating the three previously stated statements. In order to fulfil this objective, an experimental simulation study of a GI/G/1 queue with two-classes of customers was developed.

The remaining of this paper is organised as follows. Section 2 presents a literature review. Section 3 describes the methodology used to develop this study. Results of the study are shown in Section 4 while a discussion of the results is presented in Section 5. Finally, Section 6 gives the conclusions of the study.

2. Literature review

Most of the research concerned with single-server multi-class systems has studied queueing systems with priority rules (see, for example, Abate & Whitt, Citation1997; Al Hanbali, Alvarez, & van der Heijden, Citation2015; Caldentey, Citation2001; Horvath, Citation2005; Sleptchenko, Selen, Adan, & van Houtum, Citation2015; Stanford, Taylor, & Ziedins, Citation2014; Whitt, Citation1994), where a class of customers, arbitrarily or depending on some characteristic, receives service before other classes, effectively prioritising their service.

There have been a number of studies specifically concerned with studying single-server multi-class queueing systems with a FIFO discipline and different service time distributions for each class. For example, the papers of Takine (Citation2001), Boxma and Takine (Citation2003) and Masuyama and Takine (Citation2003) present a methodology to build the distribution of the total number of customers in the queue and the distribution of the number of customers of each class.

Moreover, Van Houdt and Blondia (Citation2002) proposed an algorithm to calculate the waiting time probability distribution of different classes with batch arrivals. Van Houdt and Blondia present an example where, under the FIFO discipline, the waiting time distribution of each class is different from the other classes. Le Ny (Citation2006) developed exact formulas for the stationary probabilities of the total number of customers in queue and the number of customers of each class considering a two-class M/M/1 queueing system.

In addition, He (Citation2012) proposed a methodology to calculate the probability distributions of queue lengths, cycle times, and waiting times for semi-Markov arrival processes and phase-type distributions. He presents an example where the mean waiting time of different customer classes varies between classes under the FIFO discipline, contrary to the characteristics of a M/G/1/FIFO queue where the distribution of the waiting times of all classes is the same (Boxma & Takine, Citation2003) due to the PASTA property (Wolff, Citation1982). Finally, De Clercq, Laevens, Steyaert, and Bruneel (Citation2013) studied the steady-state distribution of the number of customers in queue and the waiting times of different classes for a discrete-time queueing system.

Therefore, to the best of our knowledge, no study has specifically addressed the issue of the difference of mean waiting times between two classes of customers in a GI/G/1/FIFO queue or has particularly studied the queueing conditions in which different classes in a FIFO queue have different mean waiting times.

3. Methodology

The analytical approach has been the most commonly used methodology for studying queueing systems. However, it has seldom been used to study the topic of multi-class GI/G/1 queues due to the extreme difficulty of obtaining exact expressions for non phase-type distributions, including the GI/G/1 system (Wolff, Citation1970).

Moreover, the lognormal distribution was selected to model the distribution of inter-arrival and service times because it can describe the typical shape of the probability distribution of service times with varying values of SCV using two simple parameters (Baker & Altheimer, Citation2012). Thus, an exact analysis of the waiting time distributions for each class will be a very difficult task because the lognormal density function cannot be represented as a semi-Markovian process, hindering the ability to model the complete queueing process with exact methods, e.g. Matrix Analytic Method (Neuts, Citation1981; Latouche & Ramaswami, Citation1999).

Therefore, Discrete Event Simulation (Law, Citation2014) was selected as the modelling approach since it can model the behaviour of different queueing systems and is well suited for experimental studies where the system’s parameters are required to vary among experiments.

The primary response of this study is the difference between the mean waiting times of the two classes, calculated as the ratio between the mean waiting time of class one and the mean waiting time of class two.(1) θ=W1¯W2¯(1)

being that, W1¯ is the mean waiting time of class 1, W2¯ is the mean waiting time of class 2 and, θ is the ratio between mean waiting times of the two classes of customers.

Additionally, to investigate which factors cause a difference between mean waiting times, a number of system’s parameters were selected for the experimental study. The SCV of the inter-arrival times of class 1 (SCVA1) and class 2 (SCVA2) and the SCV of service times of class 1 (SCVS1) and class 2 (SCVS2) were selected as main factors since one of the objectives was to investigate whether a difference between mean waiting times existed only in systems with a SCV of inter-arrival times different than 1.

The total utilisation of the system (ρ), was also selected as one of the main factors of the study, as it has been shown that it is one of the most important factors in the resulting waiting times of GI/G/1 queues (Bolch, et.al Citation1998; Shanthikumar, Ding, & Zhang, Citation2007). Furthermore, different values of server’s utilisation per class (ρ1 for class 1, ρ2 for class 2) were also selected to investigate whether the source of the difference in mean waiting times of different classes is caused by a difference in the specific utilisation that each class imposes on the system or exclusively due to a difference in mean arrival rates or mean service rates.

Following suggestions from the Design of Experiments methodology (Gutiérrez & de la Vara, Citation2012) different low and high values for all the factors were selected. The actual values for each level are shown in Table . Thus, the total number of experiments resulted in 288.

Table 1. Values for each factor level

Moreover, the study was designed to have three sets of experiments with exactly the same values for all factors since the source of the variation on the specific utilisation levels per class changed on those three experiments. Thus, the values of inter-arrival and service SCV,ρ1 and ρ2, were constant while the source of the specific loads for each class changed. That is, for the first of those three experiments, the mean service times were equal for both classes while the mean inter-arrival time changed between classes to attain the desired values for ρ1 and ρ2.

The second experiment considered the same mean inter-arrival time for both classes while the mean service time changed between classes. Finally, both the mean inter-arrival time and mean service time changed between classes in a proportional way in the third experiment to attain the specific desired utilisation level per class. For example, for a desired ρ1 = 0.350 in the third experiment, class 1 will impose a lower load on the system than class 2 (ρ2 = 0.500) and, consequently, class 1 will have a proportionally higher mean inter-arrival time and higher mean service time than class 2.

Experimental values were calculated using the following formulas concerning a single-server queueing system:

(2) ρ=ρ1+ρ2(2) (3) ρ=E(S)E(A),ρ1=E(S1)E(A1)andρ2=E(S2)E(A2)(3)

(4) 1E(A)=1E(A1)+1E(A2)(4)

(5) E(S)=E(A)E(A1)E(S1)+E(A)E(A2)E(S2)(5)

being that, E(S) is the expected value of the conjunct service time considering both classes, and E(S1) and E(S2) are the mean service times of class 1 and 2, respectively, E(A) is the expected value of the conjunct inter-arrival time considering both classes, E(A1) and E(A2) are the mean inter-arrival times of class 1 and 2, respectively.

The experimental design setting was defined with the intention of investigating which could be the cause of the differences of mean waiting times between the two classes, namely, a difference between mean inter-arrival times, a difference between mean service times or a simple difference between the utilisation levels of each class.

After defining all the factorial values the actual parameters of the four lognormal distributions per experiment were calculated considering the following characteristics of the lognormal distribution:(6) E(X)=eμ+σ2/2(6) (7) Var(X)=(eσ2-1)e2μ+σ2(7)

(8) SCV(X)=eσ2-1(8)

being that, X is a random variable modelled by the lognormal distribution, μ is the mean parameter of the associated normal distribution and, σ2 is the variance parameter of the associated normal distribution.

Furthermore, since the objective of this study is concerned with finding steady-state mean waiting times of two different classes of customers, initial transient states were estimated using Welch’s method (Citation1983). The initial transient period was estimated to be 10,000 customers. The simulation length was set to 1,000,000 customers following suggestions from Chen and Kelton (Citation2006) to reach good steady-state estimations of cycle times. A total of 10 replications per experiment were run considering the time constraints of running the complete lot of experiments. Simio simulation software Version 8.139 (Kelton, Smith, & Sturrock, Citation2014) was used to run the experiments.

After running the experiments, a t-test of paired data was conducted to analyse whether the differences of mean waiting times between two classes were significant for the same experiments. Statistical analyses were done using Minitab Version 17.2.1.

4. Results

The experimental design of this study generated a total of 288 experiments. In 79 of those experiments it was found that no statistically significant differences were present between the mean waiting times of class 1 and class 2. All experiments with no statistically significant differences were found when the SCV of inter-arrival times of both classes were equal, as Table shows.

Table 2. Number of experiments with no statistically significant differences of mean waiting times between two classes at different levels of inter-arrival and service times’ SCV

Furthermore, a big proportion of the experiments with no statistically significant differences were experiments where the utilisation levels of both classes were equal (Table ). It can be seen in Table that a high level of system’s utilisation (0.95) resulted in higher number of experiments with no differences between classes. In addition, various experiments did not have statistically significant differences between mean waiting times when the arrival rate was different between classes and the service rate remained constant (“Arrival” as the source of differences in load between classes).

Table 3. Number of experiments with no statistically significant differences of mean waiting times between classes at different levels of utilisation compared with various sources of differences in load between classes

It is worth noting that half the experiments with a system’s utilisation of 0.95 and ρ1 equal to ρ2 resulted in no statistically significant differences between mean waiting times. Similarly, half the experiments with a system’s utilisation of 0.95 and the mean inter-arrival times as the source of differences in load between classes (same mean service times for the two customer classes) resulted in no statistically significant differences between classes. These mentioned experiments had equal values for SCV1A and SCV2A. On the other hand, all of the experiments with different SCV1A and SCV2A (144 experiments) resulted in statistically significant differences between the mean waiting times of each class. The complete results of experiments with no statistically significant differences can be found in the Table A1 in Appendix A.

On the other hand, Figure shows the global impact that the SCV of inter-arrival times has on the mean proportion of mean waiting times between the two classes (θ) since the biggest differences are reached when the SCV of the inter-arrival times of class 1 is different from class 2. Thus, considering these experiments, the higher the SCVA for one class was, the higher the waiting time for that class resulted. It can also be seen that, despite the fact that the impact that the SCVS has on θ is minimal, it does seem to have an impact when the SCVA is different between classes. Interestingly, the biggest difference between mean waiting times of classes is attained when the SCVS is 0.5 for both classes. Contrariwise, the impact of having different values for SCV1A and SCV2A is diminished by having a SCVS equal to 1 for both classes.

Figure 1. Mean value of θ for different values of SCV of inter-arrival and service times.

Figure 1. Mean value of θ for different values of SCV of inter-arrival and service times.

The impact that the source of differences in load between classes has on the mean θ can be clearly seen in Figure , as well as the impact of the utilization level. As it was tentatively expected, equalling the load that each customer class imposed on the system resulted in generally no differences between the waiting times of different classes. Experiments with the same mean service rate but different mean arrival rate (“Arrival” lines in Figure ) accounted for little variation between classes whereas experiments with the same mean arrival rate but different mean service rates between classes (“Service” lines in Figure ) and experiments with different arrival rates and different service rates between classes (“Both” lines in Figure ) created significant differences of mean waiting times between classes, particularly for experiments with a system’s utilisation value of 0.85.

Figure 2. Mean value of θ for different system’s utilisation values depending on different sources of differences in load between classes.

Figure 2. Mean value of θ for different system’s utilisation values depending on different sources of differences in load between classes.

The “Service” and “Both” lines in Figure present contrasting results because, to produce a ρ1 value less than ρ2, the mean service time of class 1 had to be lower than the mean service time of class 2 while maintaining the same inter-arrival time for both classes for “Service” experiments. In contrast, for “Both” experiments, the mean service time and the mean inter-arrival time of class 1 were both higher than for class 2, imposing a lower load on the system. This result shows that, for this set of experiments, the class with the highest mean service time is the class with the lowest mean waiting time, independently of the differences between mean arrival rates. This characteristic can also be seen in Table , where all of the experiments with “Service” or “Both” sources of differences in load for an utilisation level of 0.85 had statistically significant differences of mean waiting times between different classes.

These results show that having different arrival rates between the two classes does not create a significant effect on the difference between mean waiting times but having different service rates results in a difference of mean waiting times between different classes.

The relation between SCVA and the source of differences in load between classes is shown in Figure where it is shown that different values of mean service times between classes caused a higher impact on experiments with a SCVA equal to 0.5 for both classes (the dotted line in the middle of Figure ) than for experiments with different SCVA values between classes (the upper and lower lines in Figure ). Figure also shows how experiments with SCVA equal to 1 for both classes are the ones that are affected the least by a difference of mean service times between different classes. The complete results regarding θ for all the experiments can be found in the Table A2 in Appendix A.

Figure 3. Mean values of θ for different SCV values of inter-arrival times and various sources of differences in load between classes.

Figure 3. Mean values of θ for different SCV values of inter-arrival times and various sources of differences in load between classes.

5. Discussion

A number of patterns regarding the LN/LN/1/FIFO queue with two classes of customers can be appreciated from the experimental results of this study. Firstly, if a class of customer has a SCVA equal to 1 and the other has a SCVA equal to 0.5, the class with the highest SCVA will have the highest mean waiting time.

Secondly, when both classes have the same SCVA, the class with the highest mean service time will have the lowest mean waiting time. If both classes have different SCVA, the class with the highest mean service time will have a smaller mean waiting time compared with an experiment with equal service times for both classes. These results support the findings presented by He (Citation2012). On the other hand, a difference of mean arrival rates between the two classes does not seem to produce a significant difference on the mean waiting times of both classes.

Finally, the system’s utilisation imposes a restriction on the magnitude of the difference of mean waiting times between classes as the number of experiments with no statistically significant differences between the mean waiting times was higher for a 0.95 utilisation level than for a 0.85 utilisation level. This pattern is related with the notion that utilisation reduces output variability (Al Hanbali, Mandjes, Nazarathy, & Whitt, Citation2011; Buzacott & Shanthikumar, Citation1993; Wu, Citation2005). Thus, a higher utilisation reduces the general effect that inter-arrival variability has on system’s performance (Hopp & Spearman, Citation2000).

After evaluating these patterns, we can address the three statements suggested at the introduction of the study. Results showed that the difference of mean waiting times between two classes of customers is commonly present in a GI/G/1/FIFO queue as only 79 out of the 288 experiments did not have a statistically significant difference of mean waiting times between the two classes. Thus, results suggest that statement one is true: A difference of steady-state mean waiting times between two distinct classes of customers commonly exists on a GI/G/1/FIFO queueing system

Moreover, statistically significant differences were found between the mean waiting times of the two classes even in experiments where the SCV of inter-arrival times was 1 for both classes. This suggests that the difference of mean waiting times between two classes is present in single-server queueing systems with non-Poissonian arrivals, independently of the value of the SCV of inter-arrival times. This conclusion shows that statement 2 of the study is false, as not only systems with a SCV different from 1 present a difference of mean waiting times between classes. This result suggests that non-Poissonian arrivals can cause a difference of means between classes, irrespective of the SCV of inter-arrival times.

Finally, results show that the load that each class imposes on the system is not a necessary condition for creating a difference of mean waiting times between classes, that is, a difference between the utilisation factors of each class is not the main cause of a difference of mean waiting times between classes because experiments with different arrival rates but equal service rates and equal inter-arrival SCV did not have statistically significant differences.

However, having different service times for each class of customers does create a difference of mean waiting times between classes. Therefore, the conclusions of this study suggest that the third statement of this study is false, as the difference on the utilisation that each class creates on the system is not a cause, on itself, of a difference of mean waiting times between classes. Differences of mean waiting times between classes are created by either a difference in the SCV of inter-arrival times or by a difference on mean service times.

5.1. Implications of the results of the study

The two main results from this study create some relevant and contrasting implications to the OM practice. The first main result of this study, i.e. the class with the highest SCV of inter-arrival times will have the highest expected mean waiting time of the two classes, is a result that is consistent with common queueing theory results: to improve performance, reduce variability. Thus, it should be expected that the customers with the lowest variable arrivals will have the lowest expected waiting time, without any consideration for their mean arrival rate.

It could be argued that this result is fair for this class of customers as they are creating a lower penalty on system’s performance by a reduced variability, being that the topic of fairness has proven to be a topic worth investigating by various authors (Avi-Itzhak & Levy, Citation2004; Hahne, Choudhury, & Maxemchuk, Citation1990; Kim, Yoon, & Yeom, Citation2011; Wu, Wu, & Lin, Citation2007).

The second main result of this study, suggesting that the class of customers with the highest mean service times tend to have reduced mean waiting times when compared with customers with lower service times, presents a fairness problem for this type of queueing systems since the class of customers that needs more server time is the class that could expect to wait less time in the queue. Despite the fact that this is a characteristic of this system, this issue would be hard to justify to the customers that have the lowest mean service times; therefore, this type of systems would need to impose a different queueing discipline than the FIFO discipline, for example, the Shortest Expected Processing Time (SEPT) discipline, to improve the perceived fairness of their system.

5.2. Future research and limitations of the study

Since the main considerations regarding the experimental design of this study were practical, a number of limitations can be found in the results of this study to further investigate these findings.

Firstly, this study considered a GI/G/1 system with lognormal distributions with SCV values of 0.5 and 1.0. Results from this study could be limited by only having considered two values of SCV. Further studies that consider SCV values higher than 1 and lower than 0.5 are needed to analyse whether the conclusions of this study continue to hold.

A second limitation can be found in the fact that only two different utilisation factors were considered. More research is needed to study the behaviour of a two-class GI/G/1 system with FIFO discipline with different levels of traffic intensity.

6. Conclusions

This study was concerned with studying in which conditions does a difference of mean waiting times between two classes of customers are present in a GI/G/1/FIFO queue. Thus, an experimental study was prepared using Discrete Event Simulation to study the exploratory research questions of this paper.

Results from this study show that a difference of the squared coefficients of variation of inter-arrival times between the two classes is the most important factor causing a difference of mean waiting times since the class with the lowest squared coefficient of variation was the class with the lowest mean waiting time.

Moreover, a difference of mean service times between classes has also been found to be a factor causing a difference of mean waiting times between two classes of customers as the class with the highest mean service time is the class with the lowest mean waiting time.

Funding

The authors received no direct funding for this research.

Additional information

Notes on contributors

Rodrigo Romero-Silva

Rodrigo Romero-Silva received his PhD in Industrial Engineering in 2012 by TECNUN, University of Navarra, Spain. He is currently an Assistant Professor at Universidad Panamericana in Mexico City and an actual member of the National Researchers System (SNI) with funding from CONACYT. His research focus is concerned with the effects of variability on the performance of production and service systems.

Margarita Hurtado

Margarita Hurtado Hernandez holds a PhD in Industrial Engineering (Universidad de Navarra, Spain). She is the current Director of the Industrial Engineering Bachelor and Professor of the Operations Management Department at Universidad Panamericana (Mexico). She’s also the co-author of the books “El Puente” and “Top 60 mistakes made by Small and Medium Businesses and how to avoid them”.

References

  • Abate, J., & Whitt, W. (1997). Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Systems, 25, 173–233.10.1023/A:1019104402024
  • Al Hanbali, A., Mandjes, M., Nazarathy, Y., & Whitt, W. (2011). The asymptotic variance of departures in critically loaded queues. Advances in Applied Probability, 43, 243–263.10.1017/S0001867800004778
  • Al Hanbali, A., Alvarez, E. M., & van der Heijden, M. C. (2015). Approximations for the waiting-time distribution in an M/PH/c priority queue. OR Spectrum, 37, 529–552.10.1007/s00291-015-0388-9
  • Avi-Itzhak, B., & Levy, H. (2004). On measuring fairness in queues. Advances in Applied Probability, 36, 919–936.10.1017/S0001867800013185
  • Baker, K. R., & Altheimer, D. (2012). Heuristic solution methods for the stochastic flow shop problem. European Journal of Operational Research, 216, 172–177.10.1016/j.ejor.2011.07.021
  • Bolch, G., Greiner, S., de Meer, H., & Trivedi, K. S. (1998). Queueing networks and Markov chains (1st ed.). New York, NY: John Wiley & Sons.10.1002/0471200581
  • Boxma, O. J., & Takine, T. (2003). The M/G/1 FIFO queue with several customer classes. Queueing Systems, 45, 185–189.10.1023/A:1027306700614
  • Buzacott, J., & Shanthikumar, J. G. (1993). Stochastic models of manufacturing systems: International series in industrial engineering and systems engineering (1st ed.). Englewood Cliffs, NJ: Prentice-Hall.
  • Caldentey, R. (2001). Approximations for multi-class departure processes. Queueing Systems, 38, 205–212.10.1023/A:1010910531975
  • Chen, E. J., & Kelton, W. (2006, January 16). Quantile and tolerance-interval estimation in simulation. European Journal of Operational Research, 168, 520–540.10.1016/j.ejor.2004.04.040
  • De Clercq, S., Laevens, K., Steyaert, B., & Bruneel, H. (2013). A multi-class discrete-time queueing system under the FCFS service discipline. Annals of Operations Research, 202, 59–73.10.1007/s10479-011-1051-8
  • Gross, D., Shortie, J. F., Thompson, J. M., & Harris, C. M. (2008). Fundamentals of queueing theory (4th ed.). Hoboken, NJ: Wiley-Interscience.10.1002/9781118625651
  • Gutiérrez, H., & de la Vara, R. (2012). Análisis y Diseño De Experimentos (3a ed.). México, DF: McGrawHill.
  • Hahne, E. L., Choudhury, A. K., & Maxemchuk, N. F. (1990). Improving the fairness of distributed-queue-dual-bus networks. INFOCOM'90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE (pp. 175–184). Washington, DC: IEEE.
  • He, Q. (2012). Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths. Journal of Systems Science and Complexity, 25, 133–155.10.1007/s11424-012-9138-0
  • Hopp, W., & Spearman, M. (2000). Factory physics (2nd ed.). New York, NY: McGraw-Hill.
  • Horvath, G. (2005, June 4). A fast matrix-analytic approximation for the two class gi/g/1 non-preemptive priority queue. Proceeding of the 12th International Conference on Analytical and Stochastic Modeling Techniques and Applications (pp. 105–110). Riga.
  • Jaiswal, N. K. (1968). Priority queues (1st ed.). Cambridge, MA: Academic Press.
  • Kelton, W. D., Smith, J. S., & Sturrock, D. T. (2014). Simio and simulation: Modeling, analysis, applications (1st ed.). Sewickley, PA: Simio LLC..
  • Kim, J. H., Yoon, H., & Yeom, I. (2011). Active queue management for flow fairness and stable queue length. IEEE Transactions on Parallel and Distributed Systems, 22, 571–579.10.1109/TPDS.2010.104
  • Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modeling. ASA-SIAM Series on Statistics and Applied Mathematics (1st ed.). Philadelphia, PA: Society for Industrial and Applied Mathematics.10.1137/1.9780898719734
  • Law, A. (2014). Simulation modeling and analysis (5th ed.). New York, NY: McGraw-Hill.
  • Masuyama, H., & Takine, T. (2003, August 01). Analysis and computation of the joint queue length distribution in a FIFO single-server queue with multiple batch Markovian arrival streams. Stochastic Models, 19, 349–381.10.1081/STM-120023565
  • Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach (1st ed.). Mineola, NY: Dover.
  • Ny, L. M. L. (2006). Explicit formulas for the steady-state probabilities of the two-class FIFO M/M/1 queue. Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB), 2006 13th GI/ITG Conference (pp. 1–12). VDE.
  • Shanthikumar, J. G., Ding, S., & Zhang, M. T. (2007). Queueing theory for semiconductor manufacturing systems: A survey and open problems. IEEE Transactions on Automation Science and Engineering, 4, 513–522.10.1109/TASE.2007.906348
  • Sleptchenko, A., Selen, J., Adan, I., & van Houtum, G.-J. (2015). Joint queue length distribution of multi-class, single-server queues with preemptive priorities. Queueing Systems, 81, 379–395.10.1007/s11134-015-9460-z
  • Stanford, D. A., Taylor, P., & Ziedins, I. (2014). Waiting time distributions in the accumulating priority queue. Queueing Systems, 77, 297–330.10.1007/s11134-013-9382-6
  • Sztrik, J. (2016). Basic queueing theory: Foundations of system performance modeling (1st ed.). Saarbrücken: GlobeEdit.
  • Takine, T. (2001). Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions. Queueing Systems, 39, 349–375.10.1023/A:1013961710829
  • Van Houdt, B., & Blondia, C. (2002, March). The delay distribution of a type k customer in a first-come-first-served MMAPK]/PHK]/1 queue. Journal of Applied Probability, 39, 213–223.
  • Welch, P. D. (1983). The statistical analysis of simulation results. In S. S. Lavenberg (Ed.), The computer performance modeling handbook (pp. 268–328). New York, NY: Academic Press.
  • Whitt, W. (1994). Towards better multi-class parametric-decomposition approximations for open queueing networks. Annals of Operations Research, 48, 221–248.10.1007/BF02024659
  • Wierman, A. (2011). Fairness and scheduling in single server queues. Surveys in Operations Research and Management Science, 16, 39–48.10.1016/j.sorms.2010.07.002
  • Wolff, R. W. (1970). Work-conserving priorities. Journal of Applied Probability, 7, 327–337.10.1017/S0021900200034914
  • Wolff, R. W. (1982). Poisson arrivals see time averages. Operations Research, 30, 223–231.10.1287/opre.30.2.223
  • Wu, K. (2005). An examination of variability and its basic properties for a factory. IEEE Transactions on Semiconductor Manufacturing, 18, 214–221.10.1109/TSM.2004.840525
  • Wu, H. M., Wu, C. C., & Lin, W. (2007). Improving inter-server fairness in active queue management. IEEE Communications Letters, 11, 910–912.10.1109/LCOMM.2007.071001

Appendix A

Table A1. Experiments with no statistically significant differences between the mean waiting time of class 1 and class 2

Table A2. Value of θ for all of the study’s experiments