Relevant bibliographies by topics / FCFS Queue Discipline

Contents

  1. Journal articles

Academic literature on the topic 'FCFS Queue Discipline'

Author: Grafiati
Published: 7 June 2025
Last updated: 16 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'FCFS Queue Discipline.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "FCFS Queue Discipline"

1

Yamazaki, Genji, Hirotaka Sakasegawa, and J. George Shanthikumar. "A conservation law for single-server queues and its applications." Journal of Applied Probability 28, no. 1 (1991): 198–209. http://dx.doi.org/10.2307/3214750.

Full text
Abstract:
We establish a conservation law for G/G/1 queues with any work-conserving service discipline using the equilibrium equations, also called the basic equations. We use this conservation law to prove an extremal property of the first-come firstserved (FCFS) service discipline: among all service disciplines that are work-conserving and independent of remaining service requirements for individual customers, the FCFS service discipline minimizes [maximizes] the mean sojourn time in a G/G/1 queue with independent (but not necessarily identical) service times with a common mean and new better [worse] than used (NBUE[NWUE]) distributions. This extends recent results of Halfin and Whitt (1990), Righter et al. (1990) and Yamazaki and Sakasegawa (1987a,b). In addition we use the conservation law to obtain an approximation for the mean queue length in a GI/GI/1 queue under the processor-sharing service discipline with finite degree of multiplicity, called LiPS discipline. Several numerical examples are presented which support the practical usefulness of the proposed approximation.
APA, Harvard, Vancouver, ISO, and other styles
2

Yamazaki, Genji, Hirotaka Sakasegawa, and J. George Shanthikumar. "A conservation law for single-server queues and its applications." Journal of Applied Probability 28, no. 01 (1991): 198–209. http://dx.doi.org/10.1017/s0021900200039528.

Full text
Abstract:
We establish a conservation law forG/G/1 queues with any work-conserving service discipline using the equilibrium equations, also called the basic equations. We use this conservation law to prove an extremal property of the first-come firstserved (FCFS) service discipline: among all service disciplines that are work-conserving and independent of remaining service requirements for individual customers, the FCFS service discipline minimizes [maximizes] the mean sojourn time in aG/G/1 queue with independent (but not necessarily identical) service times with a common mean and new better [worse] than used (NBUE[NWUE]) distributions. This extends recent results of Halfin and Whitt (1990), Righter et al. (1990) and Yamazaki and Sakasegawa (1987a,b). In addition we use the conservation law to obtain an approximation for the mean queue length in aGI/GI/1 queue under the processor-sharing service discipline with finite degree of multiplicity, called LiPS discipline. Several numerical examples are presented which support the practical usefulness of the proposed approximation.
APA, Harvard, Vancouver, ISO, and other styles
3

Miyazawa, Masakiyo, and Genji Yamazaki. "Convex ordering of the attained waiting times in single-server queues and related problems." Journal of Applied Probability 28, no. 2 (1991): 433–45. http://dx.doi.org/10.2307/3214878.

Full text
Abstract:
The attained waiting time of customers in service of the G/G/1 queue is compared for various work-conserving service disciplines. It is proved that the attained waiting time distribution is minimized (maximized) in convex order when the discipline is FCFS (PR-LCFS). We apply the result to characterize finiteness of moments of the attained waiting time in the GI/GI/1 queue with an arbitrary work-conserving service discipline. In this discussion, some interesting relationships are obtained for a PR-LCFS queue.
APA, Harvard, Vancouver, ISO, and other styles
4

Miyazawa, Masakiyo, and Genji Yamazaki. "Convex ordering of the attained waiting times in single-server queues and related problems." Journal of Applied Probability 28, no. 02 (1991): 433–45. http://dx.doi.org/10.1017/s0021900200039802.

Full text
Abstract:
The attained waiting time of customers in service of the G/G/1 queue is compared for various work-conserving service disciplines. It is proved that the attained waiting time distribution is minimized (maximized) in convex order when the discipline is FCFS (PR-LCFS). We apply the result to characterize finiteness of moments of the attained waiting time in the GI/GI/1 queue with an arbitrary work-conserving service discipline. In this discussion, some interesting relationships are obtained for a PR-LCFS queue.
APA, Harvard, Vancouver, ISO, and other styles
5

Gast, Nicolas, and Benny Van Houdt. "Approximations to Study the Impact of the Service Discipline in Systems with Redundancy." Proceedings of the ACM on Measurement and Analysis of Computing Systems 8, no. 1 (2024): 1–33. http://dx.doi.org/10.1145/3639040.

Full text
Abstract:
As job redundancy has been recognized as an effective means to improve performance of large-scale computer systems, queueing systems with redundancy have been studied by various authors. Existing results include methods to compute the queue length distribution and response time but only when the service discipline is First-Come-First-Served (FCFS). For other service disciplines, such as Processor Sharing (PS), or Last-Come-First-Served (LCFS), only the stability conditions are known. In this paper we develop the first methods to approximate the queue length distribution in a queueing system with redundancy under various service disciplines. We focus on a system with exponential job sizes, i.i.d. copies, and a large number of servers. We first derive a mean field approximation that is independent of the scheduling policy. In order to study the impact of service discipline, we then derive refinements of this approximation to specific scheduling policies. In the case of Processor Sharing, we provide a pair and a triplet approximation. The pair approximation can be regarded as a refinement of the classic mean field approximation and takes the service discipline into account, while the triplet approximation further refines the pair approximation. We also develop a pair approximation for three other service disciplines: First-Come-First-Served, Limited Processor Sharing and Last-Come-First-Served. We present numerical evidence that shows that all the approximations presented in the paper are highly accurate, but that none of them are asymptotically exact (as the number of servers goes to infinity). This makes these approximations suitable to study the impact of the service discipline on the queue length distribution. Our results show that FCFS yields the shortest queue length, and that the differences are more substantial at higher loads.
APA, Harvard, Vancouver, ISO, and other styles
6

Felysia, Novia, Sri Wahyuningsih, and Yuki Novia Nasution. "Analisis Sistem Antrean Untuk Optimalisasi Jumlah Server Menggunakan Model Keputusan Tingkat Aspirasi." EKSPONENSIAL 12, no. 2 (2021): 153. http://dx.doi.org/10.30872/eksponensial.v12i2.808.

Full text
Abstract:
This research aims to obtain information on the number of cashiers with optimal performance in the fast food restaurant at Samarinda Central Plaza queue system using R Studio software. The queue model applied in this research is (M1/M2/c):(FCFS/∞/∞) with First Come First Served (FCFS) queue discipline. The optimal number of cashiers are determinated by using the aspiration level decision model. The results of the analysis showed that the optimal number of cashiers was 3 cashiers with an average number of customers in the queue as many as 1 customer every 15 minutes, the average number of customers in the queue system as many as 2 customers every 15 minutes, the average waiting time for customers in the queue for 1.2 minutes, the average waiting time of customers in the queue system for 6 minutes, and the percentage of idle time is 2.26% that is about 20.34 seconds
APA, Harvard, Vancouver, ISO, and other styles
7

Shalmon, Michael. "Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation." Probability in the Engineering and Informational Sciences 2, no. 2 (1988): 215–30. http://dx.doi.org/10.1017/s0269964800000747.

Full text
Abstract:
The unfinished work at arrival instants (FCFS waiting time) can be computed via the LCFS preemptive resume discipline. Analyzing the GI/GI/1 queue in this way gives full interpretation in queuing theoretic language to Feller's analysis of the fluctuations of the random walk. Also, this approach leads naturally to stochastic decompositions for the queue with set-up times, and for other variations of the standard queue. For the M/G/1 queue, the derivations are qualitative, and there are additional connections to branching processes.
APA, Harvard, Vancouver, ISO, and other styles
8

Nurahmadiningsi Nurahmadiningsi, Nadia Manurung, Nico Dhemus, Dinda Setyasari, Dittha Kumari, and Ni Ketut Tari Tastrawati. "Penerapan Model Multi Channel Single Phase dalam Optimisasi Layanan Restoran Cepat Saji." Gemawisata: Jurnal Ilmiah Pariwisata 20, no. 3 (2024): 42–47. http://dx.doi.org/10.56910/gemawisata.v20i3.374.

Full text
Abstract:
A queue is a waiting line from a service facility. Long queues are caused by the number of consumers who come more than the number of service facilities, it is necessary to apply a queuing model to overcome long queues. This research was conducted at Mc Donald's Jimbaran fast food restaurant because the fast food restaurant is located in a tourist and lecture area, causing queues. The current condition at Mcdonald’s Jimbaran there are more than one service facility, the discipline of the first come first service (FCFS) queue is in accordance with the single-phase multi-channel. After analyzed with data from 31 May 2022 to 06 June 2022 for 7 days. Based on the results of the analysis obtained, it can be concluded that at lunch time requires 4 services while at dinner time only requires 2 service.
APA, Harvard, Vancouver, ISO, and other styles
9

Indrajaya, Drajat, and Riri Cornellia. "Analisis Model Antrian Loket Transaksi pada PT. POS Indonesia (persero) Kantor Cabang Sawangan dengan Menggunakan Software Promodel." STRING (Satuan Tulisan Riset dan Inovasi Teknologi) 3, no. 2 (2018): 170. http://dx.doi.org/10.30998/string.v3i2.2828.

Full text
Abstract:
Simulation is a process of imitation of a tangible thing and its surroundings. The problem found in this study is a long queue at the payment counter resulting from numerous customers who come to POS Company. It is also caused by some factors such as a small number of cash registers, with only 2 counters functioned irregularly and less extensive queue lines. Considering that, an analysis of the queues at the payment counters using pro model software application is made to anticipate the long queues. This simulation is run for 6 hours with 10-time replication, verified and is then validated. The queue model used is (M/M/2):(FCFS/~/~), meaning the number of arrivals uses Poisson distribution and the service time uses exponential distribution. With the number of facility service as many as 2 people, the discipline used is the customer who comes first will be served first (first come first serve). The number of queues in the queue system and the size of the population at the source of arrival is infinite. The average percentage of teller utilities is 62.14% and the idle percentage of teller is 37.86%. The average number of customers completing transactions is 119.30 ? 120 customers for 6 hours. The average time spent by customers in the queue until they are served is 3.67 minutes. The average time customer spends in the system is 6.08 minutes.
APA, Harvard, Vancouver, ISO, and other styles
10

Saini, Aarti, Deepak Gupta, and A. K. Tripathi. "Analytical Study of Two Serial Channels with Priority and Reneging." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 6 (2023): 89–93. http://dx.doi.org/10.17762/ijritcc.v11i6.7237.

Full text
Abstract:
Most of the studies of queuing theory, which are useful in our daily life has been investigated by many researchers. The present research is the study of pre-emptive priority queuing system consisting two serial channels in stochastic environment. The impatient behavior of customer’s will be discussed with exponential service distribution and Poisson arrivals. Higher priority customers have pre-emptive priority over the low priority customers. The G.F. technique is used to derive the performance measures of high & low priority queues and assuming FCFS discipline in busy schedule of higher priority class. Also evaluate queue behavior graphically and discussed a special case at the end which shows utilization of channels.
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'FCFS Queue Discipline' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography