Увійти

Готові списки джерел за темами / Queuing theory / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Queuing theory.

Статті в журналах з теми "Queuing theory"

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 1 серпня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Queuing theory".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Wang, Yulu. "Research on the Queuing Theory based on M/M/1 Queuing Model." Highlights in Science, Engineering and Technology 61 (July 30, 2023): 80–87. http://dx.doi.org/10.54097/hset.v61i.10276.

Повний текст джерела

Анотація:

A collection of mathematical theories and models make up queueing theory. The theory, which is derived from several models, makes an effort to recreate numerous typical queue waiting models. The purpose of this study is to do research on the M/M/1 queuing model-based queueing theory. After a brief introduction to the queuing theory, the independent indexes and the dependent variables will be shown. This paper contains some fundamental queuing theory formulas, some of which are specifically derived for the M/M/1 queuing model. This study then presents a simulation of the M/M/1 queuing model. Since some results are attained, this paper revealed some probability distributions and distribution functions of several indexes. The data characteristics displayed by these figures are very consistent with the daily life situation, which also proved the rationality and M/M/1 queuing model's applicability. By investigating this queuing theory, people shall be able to understand, analyze, and predict the phenomenon of waiting in a line.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Borodin, Allan, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan, and David P. Williamson. "Adversarial queuing theory." Journal of the ACM 48, no. 1 (January 2001): 13–38. http://dx.doi.org/10.1145/363647.363659.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

A.Sridhar, H. Saddam Hussain,. "Economical Situation of the M/M/1/κ Markovian Queueing system with Encouraged Incoming and maintained of Reneged Customers". Tuijin Jishu/Journal of Propulsion Technology 44, № 4 (16 жовтня 2023): 6042–48. http://dx.doi.org/10.52783/tjjpt.v44.i4.2036.

Повний текст джерела

Анотація:

Today’s businesses all strive to operate smoothly and efficiently in order to meet customer demandand provide the best possible service because of the intense competition. The queuing theory is crucial in this situation. Queueing models can assist businesses in understanding their performance in advance, enabling themto plan effectively for providing seamless and effective customer service as well as long-term sustainability. Businesses entice customers to sign up for the system by offering promotions and discounts. Customers wait even longer in queue to receive services as a result of incentives like discounts.An analysis is conducted on a finite Markovian single-server queuing model with encouraged arrivals, reneging, and retention of reneged customers. Iterative derivation is used to reach the model's steady state solution. Additionally, the queueing model's performance metrics are gathered. As unique example of this model,several significant queuing models are derived. In order to develop a cost model, a model's economic analysis is presented, and a discussion of numerical representation is also included.Customers are added when they are welcomed, which changes the way theybehave in a queueing system.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

P, Divya. "Queuing Theory in Traffic Management System." International Journal for Research in Applied Science and Engineering Technology 9, no. 12 (December 31, 2021): 233–38. http://dx.doi.org/10.22214/ijraset.2021.39081.

Повний текст джерела

Анотація:

Abstract: In cities where the number of vehicles has consistently expanded faster than the transportation infrastructure available to serve them. More on queuing theory and its crucial application has been discussed in the current study. In Thudiyalur, Gandhipuram, and Periyanaickenpalayam, all in Coimbatore, this research examines the usefulness of queuing theory in the field of traffic management. The concept of traffic intensity isapplied to a set of areas in queuing theory in this study. Keywords: Traffic intensity, Queuing theory, Single server Poisson model

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Min, Xu Guang, Tao Wan, Jun Fang, and Shan Liu. "Design of TVM Based on Parallel Virtual Queuing Theory." Advanced Materials Research 1030-1032 (September 2014): 2195–98. http://dx.doi.org/10.4028/www.scientific.net/amr.1030-1032.2195.

Повний текст джерела

Анотація:

From what has been discussed above, the design of parallel virtual queuing, means that the passenger chooses the trains, the time, departures and terminals, seat types on TVM by blackening a ticket purchasing card. All the job off the TVM can be done by all the passengers all at once, which is equal to every passenger is being served at the counter (TVM), and thus the queuing time are greatly reduced in peak hours. Therefore, the queuing is equal to “Parallel Virtual Queuing”, and the equivalent queuing model is M/M/∞/∞/∞/FCFS.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Ma, Fan-Qi, and Rui-Na Fan. "Queuing Theory of Improved Practical Byzantine Fault Tolerant Consensus." Mathematics 10, no. 2 (January 7, 2022): 182. http://dx.doi.org/10.3390/math10020182.

Повний текст джерела

Анотація:

In recent years, the use of consensus mechanism to maintain the security of blockchain system has become a considerable concern of the community. Delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT) consensus mechanisms are key technologies in maintaining the security of blockchain system. First, this study proposes a consensus mechanism combining DPoS and PBFT, which can rapidly deal with malicious witness nodes and shorten the time of block verification. Second, the M/PH/1 queuing model is used to analyze the performance of the proposed consensus mechanism, and the performance of the improved practical Byzantine fault tolerant consensus mechanism is evaluated from steady-state conditions and key performance measure of the system. Third, the current study uses the theoretical method of open (Jackson) queuing network, combined with the blockchain consensus process, and provides theoretical analysis with special cases. Lastly, this research utilizes numerical examples to verify the computability of the theoretical results. The analytic method is expected to open a series of potentially promising research in queueing theory of blockchain systems.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Hess, Svjetlana, and Ana Grbčić. "The Multiphase Queuing System of the Rijeka Airport." Pomorstvo 33, no. 2 (December 19, 2019): 205–9. http://dx.doi.org/10.31217/p.33.2.10.

Повний текст джерела

Анотація:

The paper gives an overview of the real system as a multiphase single server queuing problem, which is a rare case in papers dealing with the application of the queueing theory. The methodological and scientific contribution of this paper is primarily in setting up the model of the real problem applying the multiphase queueing theory. The research of service system at Rijeka Airport may allow the airport to be more competitive by increasing service quality. The existing performance measures have been evaluated in order to improve Rijeka Airport queueing system, as a record number of passengers is to be expected in the next few years. Performance indicators have pointed out how the system handles congestion. The research is also focused on defining potential bottlenecks and comparing the results with IATA guidelines in terms of maximum waiting times.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Nosek, Ronald Anthony, and James P. Wilson. "Queuing Theory and Customer Satisfaction: A Review of Terminology, Trends, and Applications to Pharmacy Practice." Hospital Pharmacy 36, no. 3 (March 2001): 275–79. http://dx.doi.org/10.1177/001857870103600307.

Повний текст джерела

Анотація:

Queuing theory is the formal study of waiting in line and is an entire discipline in operations management. This article will give the reader a general background into queuing theory, its associated terminology, and it relationship to customer satisfaction. Queuing theory has been used in the past to assess such things as staff schedules, working environment, productivity, customer waiting time, and customer waiting environment. In pharmacy, queuing theory can be used to assess a multitude of factors such as prescription fill-time, patient waiting time, patient counseling-time, and staffing levels. The application of queuing theory may be of particular benefit in pharmacies with high-volume outpatient workloads and/or those that provide multiple points of service. By better understanding queuing theory, service managers can make decisions that increase the satisfaction of all relevant groups – customers, employees, and management.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Večeřa, Filip, and Lukáš Pavlík. "The finding of the queuing theory models for evaluation throughput of the IRS radio network in the Czech Republic." MATEC Web of Conferences 292 (2019): 02006. http://dx.doi.org/10.1051/matecconf/201929202006.

Повний текст джерела

Анотація:

The queuing theory is a discipline that uses mathematical procedures to evaluate the usability of the utilization system - a radio-communication network. The paper describes the basic parameters of queuing systems and explains the individual variables used in queuing theory models. The functional principles of individual queuing theory models are graphically depicted in the article. The article also includes basic knowledge of the functions of the PEGAS radio communication network, which is used by IRS in the Czech Republic. Not least, the article searches for the most convenient model of queuing theory for the possible evaluation of the transmissivity of the Czech IRS radio network.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Li, Guoshuai. "Markov chain and queuing theory in nucleic acid tests." Theoretical and Natural Science 19, no. 1 (December 8, 2023): 6–11. http://dx.doi.org/10.54254/2753-8818/19/20230474.

Повний текст джерела

Анотація:

This article mainly introduces M/M/1 queue and M/M/S queue applied in nucleic acid tests which are applications of Markov chains in queuing theory. Firstly, it is pointed that in the two kinds of queuing models, the arrival time and the service time have no aftereffect which means the two kinds of time both belong to the Markov chain, and it is also illustrated that the arrival time and the service time obey the Poisson distribution, which reflects the uniqueness and stability of the two types of queuing models. The distribution functions of waiting time, service time queue length and so on could be obtained by solving the models. Therefore, by comparing the advantages and disadvantages of different models, the managers could make better decisions which are helpful to allocate resources reasonably, avoid overcrowding and decrease the risk of virus transmission. Furthermore, some other queuing models which are in the more special cases and the innovations of many queuing models are also presented briefly. In the end, the applications of such queuing models in other fields are shown.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Fazlollahtabar, Hamed, and Hadi Gholizadeh. "Application of queuing theory in quality control of multi-stage flexible flow shop." Yugoslav Journal of Operations Research 30, no. 1 (2020): 101–19. http://dx.doi.org/10.2298/yjor181115023f.

Повний текст джерела

Анотація:

In this paper, we carry out queuing analysis to examine and integrate a quality control (inspection) process into a multi-stage flexible ow shop configured in an M=M=1 queue system. Our main concern is to improve the performance of multi-stage exible ow shop production. Besides, this work aims to help managers in improving their effeciency and effectiveness, and in selecting a joint inspection, being the most suitable policy for minimizing inspection and queueing related costs. We adopt an analytical approach based on real-life data from a Kach company that produces disposable appliances. Queuing analysis reported in this work provides a basis for estimating and analyzing production systems by measures such as utilization, the percentage of the idle workstation, number of batches in the system, number of batches in the queue, expected time spent in the queue, and expected time spent in the system. The results indicate the performance of the company in relation to inspection and expected time.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Tarasov, Veniamin N., and Nadezhda F. Bakhareva. "Delay model based on shifted hyperexponential and Erlang distributions." Physics of Wave Processes and Radio Systems 25, no. 1 (March 29, 2022): 21–26. http://dx.doi.org/10.18469/1810-3189.2022.25.1.21-26.

Повний текст джерела

Анотація:

This article is devoted to the derivation of results for the average delay of requests in the queue for a queuing system formed by two flows with the laws of interval distributions in the form of second-order hyperexponential and Erlang distributions shifted to the right. In queuing theory, studies of G/G/1 systems are relevant due to the fact that there is no solution in the final form for the general case. Therefore, in the study of such systems, various particular distribution laws are used as an arbitrary distribution law for G. In this case, the use of the hyperexponential distribution law ensures the coefficient of variation of the input flow intervals is large units, and the Erlang distribution is less than one. To solve the problem posed, the method of spectral decomposition of the solution of the integral Lindley equation was used, which plays an important role in the queueing theory. This method made it possible to obtain a solution for the average delay of requests in the queue for the system under consideration in a closed form. As is known, the remaining characteristics of the queuing system are derived from the average delay of requests.

Стилі APA, Harvard, Vancouver, ISO та ін.

13

González-López, Verónica Andrea, Ramin Gholizadeh, and Aliakbar M. Shirazi. "Optimization of Queuing Theory Based on Vague Environment." International Journal of Fuzzy System Applications 5, no. 1 (January 2016): 1–26. http://dx.doi.org/10.4018/ijfsa.2016010101.

Повний текст джерела

Анотація:

Waiting lines or queues are commonly occurred both in everyday life and in a variety of business and industrial situations. The various arrival rates, service rates and processing times of jobs/tasks usually assumed are exact. However, the real world is complex and the complexity is due to the uncertainty. The queuing theory by using vague environment is described in this paper. To illustrate, the approach analytical results for M/M/1/8 and M/M/s/8 systems are presented. It optimizes queuing models such that the arrival rate and service rate are vague numbers. This paper results a new approach for queuing models in the vague environment that it can be more effective than deterministic queuing models. A numerical example is illustrated to check the validity of the proposed method.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Srivastava, Riktesh. "Service Quality Control using Queuing Theory." Emirati Journal of Business, Economics, & Social Studies 1, no. 1 (October 23, 2023): 36–41. http://dx.doi.org/10.54878/ze26qd25.

Повний текст джерела

Анотація:

Customers are compelled to queue when a service system is at its busiest. This issue not only reduces customer pleasure, but it also causes the company to lose money. For consumer losses, this study proposes a queue model of customer queuing behavior. The goal is to reduce customer losses, hence researchers are looking at queue setup and optimization in random service systems. We developed three queuing models: MG1, GM1, and GG1 for estimating service quality control. We investigate queuing systems for predicting replies for service quality control based on queue models of customer behavior. The study found that the MG1 queue model yields the best service quality, however the GM1 and GG1 results are relatively close behind.

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Tadj, L. "Waiting in line [queuing theory]." IEEE Potentials 14, no. 5 (1996): 11–13. http://dx.doi.org/10.1109/45.481505.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Neiman, V. I. "Teletraffic and the queuing theory." Automation and Remote Control 70, no. 12 (December 2009): 1965–73. http://dx.doi.org/10.1134/s0005117909120042.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Terbille, Charles. "Queuing theory and reference transactions." Reference Services Review 23, no. 3 (March 1995): 75–84. http://dx.doi.org/10.1108/eb049257.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Kiwi, M., M. Soto, and C. Thraves. "Adversarial queuing theory with setups." Theoretical Computer Science 410, no. 8-10 (March 2009): 670–87. http://dx.doi.org/10.1016/j.tcs.2008.09.064.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Gerontidis, Ioannis I., and V. V. Kalashnikov. "Mathematical Methods in Queuing Theory." Statistician 44, no. 3 (1995): 409. http://dx.doi.org/10.2307/2348715.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Kel'bert, M. Ya, and Yu M. Sukhov. "Mathematical theory of queuing networks." Journal of Soviet Mathematics 50, no. 3 (June 1990): 1527–600. http://dx.doi.org/10.1007/bf01096288.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Siddiqui, Shadab, Manuj Darbari, and Diwakar Yagyasen. "An QPSL Queuing Model for Load Balancing in Cloud Computing." International Journal of e-Collaboration 16, no. 3 (July 2020): 33–48. http://dx.doi.org/10.4018/ijec.2020070103.

Повний текст джерела

Анотація:

Load balancing is the process of distributing a workload among various servers. Queuing is the most common scenario for day-to-day applications. Queuing theory is used to study the problem of waiting lines. Queuing theory bridges the gap between service demands and the delay in replies given to users. The proposed QPSL Queuing Model makes use of M/M/k queue with FIFO queue discipline for load balancing in cloud computing. The model makes use of exponential distribution for calculating service rates and Poisson distribution for calculating waiting lines. The proposed QPSL queuing model is also compared with other existing queuing models for load balancing on various parameters. The experimental analysis depicts that QPSL model performed better in terms of service rate and response time.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Aziziankohan, Arvin, Fariborz Jolai, Mohammad Khalilzadeh, Roya Soltani, and Reza Tavakkoli-Moghaddam. "Green supply chain management using the queuing theory to handle congestion and reduce energy consumption and emissions from supply chain transportation fleet." Journal of Industrial Engineering and Management 10, no. 2 (May 15, 2017): 213. http://dx.doi.org/10.3926/jiem.2170.

Повний текст джерела

Анотація:

Purpose: Nowadays, governments and people pay more attention to use green products due to environmental pollution, irreplaceable energy and shortage of resources. Green products are resulted from the application of green supply chain management strategies to the organizations' performance strategies, so that we can reduce environmental pollutants and wastes and take a step towards saving energy with limited resources.Methodology: In this paper, the effect of reducing energy consumption in green supply chain is examined by using queuing theory and transportation models. Data was generated and solved by a commercial optimization epackage.Findings: The findings indicate that suitable assignment of existing transportation fleet with specified capacity, and using queueing theory in a closed-loop network to reduce the queue length and handle congestion, can cause a reduction in energy consumption by optimizing transportation and waiting times in a green supply chain.Originality/value: Adopting investment strategy in improving the environmental performance of the supply chain, will yield in many advantages and benefits. This article investigates the effect of queuing theory on reducing waiting time, optimizing energy consumption in green supply chain, and consequently decreasing pollution.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Himanshu Mittal. "Simulation Model to Optimize Hospital Pharmacy Operation using Queuing Theory." Communications on Applied Nonlinear Analysis 31, no. 2s (May 30, 2024): 266–76. http://dx.doi.org/10.52783/cana.v31.644.

Повний текст джерела

Анотація:

The pharmacy sector is a vital component in the ever-changing landscape of the healthcare business, with increased demands with high percentage of ageing population and the initiation of manufacturing and import of specialised medications. The efficient management of pharmacy operations is paramount to meet patients' rising expectations for swift, accurate, and safe medication services. This research explores the use of queuing theory, a mathematical framework for analysing waiting lines and service systems, in the pharmaceutical industry. It dives into how queuing models are used, their influence on operations, and their future possibilities. The results suggested that application of queuing theory can enhance the operation efficiency and could minimize the operational challenges. As pharmacies adjust to changing patient requirements and technology improvements, the application of queuing theory becomes more important, promising improved patient care and operational efficiency.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Krisna, Daffandri Dwi, and Sumiati Sumiati. "Optimization of Teller Services Using Queuing Theory at XYZ Bank." IJIEM - Indonesian Journal of Industrial Engineering and Management 4, no. 3 (December 27, 2023): 440. http://dx.doi.org/10.22441/ijiem.v4i3.21359.

Повний текст джерела

Анотація:

Bank XYZ is one of the largest state-owned banks in Indonesia that provides various financial services. Currently Bank XYZ has 3 teller services only. This study aims to determine the use of customer queuing schemes currently used in XYZ bank teller services. The data processed is the arrival of customers who transact at the teller area of Bank XYZ. This study uses the Queuing Theory method with the M / M / S (Multiple Channel Single Phase) model and also uses FlexSim software. Then analyze with the addition of the number of tellers (services). Finally, a comparison is made between manual and software calculation methods. Based on the results of the data analysis, the optimal improvement in the application of the queuing system is to add 1 teller service to 4 teller services. The improvement in the performance of the queuing system is characterized by a reduction in the number of customers in line at peak hours 10.00 - 11.00 which initially amounted to 11 people reduced to 3 people and the average waiting time of customers in the queue from 10.08 minutes to 4.02 minutes. Therefore, optimal queuing system performance can be ensured by increasing the number of tellers to four.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Mubarak, Rio, Setiyo Budiyanto, Putri Wulandari, Fajar Rahayu, Andi Adriansyah, and Mudrik Alaydrus. "A queue theory in the cross-polarization of antenna in satellite communication." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 2 (May 1, 2021): 884. http://dx.doi.org/10.11591/ijeecs.v22.i2.pp884-892.

Повний текст джерела

Анотація:

<span>Satellite communication is a telecommunications technique that uses satellites as a connecting component, for example VSAT. In antenna installation, there is an important process which is called the cross-polarization. Cross-polarization is one process that cannot be released inside installation of VSAT antennas for satellite communication. Sometimes, in this process, a user queue will occur. Queuing theory explain the process is done and also calculate the other factors that are in the process. By knowing queuing theory to the cross-polarization, it will be easy to know the efficiency of queuing theory in the cross-polarization. Based on the characteristics of the cross-polarization, user can be known the queuing model that used and performance of the queuing system. The queuing model for the cross-polarization, using Kendall notation, M/M/1. Based on the analysis that has been done; by using 1 server the value of service level (ρ) is 0.67, using 2 servers = 0.33 and 3 servers = 0.22. The waiting time in the queue is longer if using 1 server which is 0.67 hours or 40 minutes. If a satellite operator uses 2 servers, waiting time in the queue is 25 minutes and 3 servers is 2.8 minutes which means that there is almost no waiting time in the queue.</span>

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Liu, Jia Hua. "Model of Confirming Number of BRT Parking Space Based on Queuing Theory." Advanced Materials Research 838-841 (November 2013): 2131–35. http://dx.doi.org/10.4028/www.scientific.net/amr.838-841.2131.

Повний текст джерела

Анотація:

Queuing in the bus station often causes traffic jam which will influence the run of the system owing to the fact of the special of the BRT system. It was after analyzed the fact of the BRT system, created the model about the probability of the vehicle reaching the station without queuing and other service index by use of the queuing theory in order to calculate the number of BRT parking space. The calculating result which is based on the Shangshe bus station of Guangzhou BRT system show that the model is reasonable and effective.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Kumar, Binay, Ashu Vij, and Pankaj Kumar. "Some Basic Concepts in Queuing Theory." IARJSET 2, no. 12 (December 20, 2015): 56–60. http://dx.doi.org/10.17148/iarjset.2015.21209.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Hohn, N., D. Veitch, K. Papagiannaki, and C. Diot. "Bridging router performance and queuing theory." ACM SIGMETRICS Performance Evaluation Review 32, no. 1 (June 2004): 355–66. http://dx.doi.org/10.1145/1012888.1005728.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Shan, Yong, and Wen Bin Liu. "The Study of Traffic Queuing Based on Computer Simulations and Queuing Theory." Applied Mechanics and Materials 556-562 (May 2014): 3404–7. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.3404.

Повний текст джерела

Анотація:

In view of traffic queuing question, this article has established the dynamic queuing theory model, considered the waiting the traffic flow magnitude and the vehicles density. On this basis, through computer random simulations,we found that traffic conditions can be divided into three statuses,and found out the key conditions of formation for each status. The results can be widely promoted, and can provide advice to government

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Faizullin, Rinat. "Game Reproduction of the Queuing System as an Economic Laboratory Experiment." SHS Web of Conferences 110 (2021): 01050. http://dx.doi.org/10.1051/shsconf/202111001050.

Повний текст джерела

Анотація:

This article presents the results of an economic laboratory experiment based on a queuing system. The “classical” problem of the theory of mass service, known as the Erlang problem, with the aim of studying the behavioral theory of games reproduced in this article. It is based on the theory of queuing, which allows the company to avoid inefficient organization of customer service. Considerable attention is paid to the provisions of the behavioral theory of games as a method of making management decisions and their practical application. A mathematical model of decision making studied by queuing theory was compiled. There are Conclusions about the behavior in real economic situations. The experiment presented in the form of a game can be used as an original method of teaching economics.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Wu, Jingna, Bo Chen, Danping Wu, Jianqiang Wang, Xiaodong Peng, and Xia Xu. "Optimization of Markov Queuing Model in Hospital Bed Resource Allocation." Journal of Healthcare Engineering 2020 (December 8, 2020): 1–11. http://dx.doi.org/10.1155/2020/6630885.

Повний текст джерела

Анотація:

Bed resources are the platform in which most medical and health resources in the hospital play a role and carry the core functions of the health service system. How to improve the efficiency of the use of bed resources through scientific management measures and methods and ultimately achieve the optimization of overall health resources is the focus of hospital management teams. This paper analyzes the previous research models of knowledge related to queuing theory in medical services. From the perspective of the hospital and the patient, several indicators such as the average total number of people, the utilization rate of bed resources, the patient stop rate, and the patient average waiting time are defined to measure the performance of the triage queue calling model, which makes the patient queue more reasonable. According to the actual task requirements of a hospital, a Markov queuing strategy based on Markov service is proposed. A mathematical queuing model is constructed, and the process of solving steady-state probability based on Markov theory is analyzed. Through the comparative analysis of simulation experiments, the advantages and disadvantages of the service Markov queuing model and the applicable scope are obtained. Based on the theory of the queuing method, a queuing network model of bed resource allocation is established in principle. Experimental results show that the queuing strategy of bed resource allocation based on Markov optimization effectively improves resource utilization and patient satisfaction and can well meet the individual needs of different patients. It does not only provide specific optimization measures for the object of empirical research but also provides a reference for the development of hospital bed resource allocation in theory.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Bisen, Tijeshwari, and Arun Garg. "MATHEMATICAL MODELLING IN WAITING QUEUE IN SHOPPING MALL." International Journal of Advanced Research 11, no. 09 (September 30, 2023): 736–43. http://dx.doi.org/10.21474/ijar01/17583.

Повний текст джерела

Анотація:

This project is an attempt to analyze the use of queuing theory in a local shopping mall. Also considers the mall as a multi server queuing system following Poisson arrival and Exponential service based system. A comparison of the results using MATLAB pertaining to double server and multiple server queuing system is also provided.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Tarasov, Veniamin N., and Nadezhda F. Bakhareva. "Spectral expansion method for analysis of a system with shifted Erlang and hyper-Erlang distributions." Physics of Wave Processes and Radio Systems 24, no. 2 (September 6, 2021): 55–61. http://dx.doi.org/10.18469/1810-3189.2021.24.2.55-61.

Повний текст джерела

Анотація:

In this paper, we obtained a spectral expansion of the solution to the Lindley integral equation for a queuing system with a shifted Erlang input flow of customers and a hyper-Erlang distribution of the service time. On its basis, a calculation formula is derived for the average waiting time in the queue for this system in a closed form. As you know, all other characteristics of the queuing system are derivatives of the average waiting time. The resulting calculation formula complements and expands the well-known unfinished formula for the average waiting time in queue in queuing theory for G/G/1 systems. In the theory of queuing, studies of private systems of the G/G/1 type are relevant due to the fact that they are actively used in the modern theory of teletraffic, as well as in the design and modeling of various data transmission systems.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Adams, A. E. "A Queuing Structure Simulator for An Ms-Dos Personal Computer." International Journal of Electrical Engineering & Education 29, no. 1 (January 1992): 24–34. http://dx.doi.org/10.1177/002072099202900103.

Повний текст джерела

Анотація:

A queuing structure simulator for an MS-DOS personal computer A simulator is described whose purpose is to provide a didactic aid for the teaching of the theory and operation of queuing systems. The program allows the user to build different queue models and to investigate the operation of the models with varying queuing protocols, server and arrival rates.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Michael, A. Andrew, та M. Thiagarajan. "A Virtualized Target Queuing Balanced Model Using Vmax/M/G-Load(Min)/Cache-P2λM for Reducing Queuing Time Expectation of Customer Delay Tolerance". Journal of Computational and Theoretical Nanoscience 17, № 12 (1 грудня 2020): 5520–27. http://dx.doi.org/10.1166/jctn.2020.9448.

Повний текст джерела

Анотація:

Queuing theory is a formal mathematical model of late response arrival of customer waiting in various access services, accepting processes management as a whole field. Often multiple server sorting can be used to estimate the number of servers and service rates be high due too lacking of time, with an average delay sequence in the analysis. Using these sequence models to read more than one sequence during execution approximates system sorting performance. To resolve this problem we modulated the distributed process into Virtualized Target Queuing Balanced Model (VTQBM) using Vmax/M/G-Load (Min)/Cache-P2λM for reducing queuing time expectation of customer delay tolerance. The Virtual Resource queuing System is optimized with fork-join queue by creating single to multimodal service performance using target request load balancer in a shared distribution mode. Sorting the request buffer cache is created based on Customer Request Arrival Rate (CRAR) and resource output preferred to check with target rule waiting in the Load balancer. To improve the use of model complex virtual resource sharing shared with customer arrival to Cache Target Load Allocator (CTLA) on queuing distributed resources, This fork joiner target the service performance to reduce the customer waiting time in queuing and produce outputs can achieve a different parameter input transformation on queuing theory.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Kushvaha, Bhaskar, Dhruba Das, and Asmita Tamuli. "Single server queueing model with Poisson arrival and gamma service time distribution." Global Journal of Computer Sciences: Theory and Research 14, no. 1 (April 25, 2024): 15–27. http://dx.doi.org/10.18844/gjcs.v14i1.9324.

Повний текст джерела

Анотація:

Queueing theory is pivotal in understanding waiting lines and their pervasive role in everyday life. Its profound application spans across diverse sectors, including computer programming networks, healthcare, transportation, and so on. Researchers have applied many statistical distributions in analyzing queueing data. This article focuses on the analysis of a single server queueing system with Poisson input and service times distributed according to a two-parameter gamma distribution. The study elaborates on the construction and estimation of key queueing properties such as steady state equations, average number of customers in the system, average queue length, expected size of the non-empty queue, distribution of waiting time, average waiting time in the system, and average waiting time in the queue of the M/Gamma/1 queueing model using the two-parameter gamma distribution. Keywords: Gamma distribution; Poisson; service; single server; queuing model.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Хвостова, Е. А., Ю. А. Андрусенко, В. В. Драгуленко, and К. А. Ковалева. "The theory of queuing in the management of urban transport systems." Applied Economic Researches Journal, no. 1 (March 30, 2024): 60–67. http://dx.doi.org/10.47576/2949-1908.2024.1.1.007.

Повний текст джерела

Анотація:

В статье дается анализ применения теории массового обслуживания в контексте управления городскими транспортными системами. Работа фокусируется на изучении влияния теории массового обслуживания на эффективность и функциональность городской транспортной инфраструктуры. Теория массового обслуживания, представляющая собой комплексный математический аппарат для описания и анализа систем массового обслуживания, где субъекты (клиенты) обращаются за получением определенных услуг, занимает центральное место. В контексте городских транспортных систем эти субъекты выступают в роли пассажиров, ожидающих обслуживание на остановках и перемещающихся с помощью транспортных средств. Исследование представляет собой значительный вклад в разработку и реализацию инновационных подходов к управлению городскими транспортными системами на основе принципов теории массового обслуживания, что имеет ключевое значение для повышения эффективности и устойчивости городской транспортной инфраструктуры в условиях быстро меняющегося городского ландшафта. The article analyzes the application of queuing theory in the context of urban transport system management. The work focuses on the study of the impact of queuing theory on the efficiency and functionality of urban transport infrastructure. The theory of queuing, which is a complex mathematical apparatus for describing and analyzing queuing systems where subjects (customers) apply for certain services, occupies a central place in our study. In the context of urban transport systems, these actors act as passengers waiting for service at stops and moving by means of vehicles. The research represents a significant contribution to the development and implementation of innovative approaches to the management of urban transport systems based on the principles of queuing theory, which is of key importance for improving the efficiency and sustainability of urban transport infrastructure in a rapidly changing urban landscape.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Hidayah Mohd Zaki, Noor, Aqilah Nadirah Saliman, Nur Atikah Abdullah, Nur Su Ain Abu Hussain, and Norani Amit. "Comparison of Queuing Performance Using Queuing Theory Model and Fuzzy Queuing Model at Check-in Counter in Airport." Mathematics and Statistics 7, no. 4A (September 2019): 17–23. http://dx.doi.org/10.13189/ms.2019.070703.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Tan, Rong Hua. "The Application of Computer Simulation Technology in the Queuing System Optimization." Applied Mechanics and Materials 556-562 (May 2014): 3849–51. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.3849.

Повний текст джерела

Анотація:

The optimization Problem of queuing system is an important research subject in the queuing system.There are two ways to solve this problem:one is the traditional theoretical analysis, the other is the application of computer simulation. This thesis introduces the queuing theory and the simulation technique of discrete event system, including fundamental conceptions, methods, performance index and classical model of queuing system, as well as the definition of simulation and the procedure of the simulation of discrete event system. And procedure and parameters set of general modeling methods are analyzed.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Peng, Edwin. "Exact Response Time Analysis of Preemptive Priority Scheduling with Switching Overhead." ACM SIGMETRICS Performance Evaluation Review 49, no. 2 (January 17, 2022): 72–74. http://dx.doi.org/10.1145/3512798.3512824.

Повний текст джерела

Анотація:

The study of preemptive scheduling is essential to computer systems [15, 12, 3, 4]. Motivated by this, decades of queueing theory research have been done on the subject [19, 18, 16, 13, 21, 8, 17, 2, 11, 20, 10, 1]. However, almost all queuing theoretic literature on preemptive scheduling concerns systems without switching overhead - pausing or resuming a job is assumed to be instant. Practically speaking, switching in computer systems incurs some overhead [14], which causes a divide between models in research and the real world.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Qiu, Guo Bing, Wen Xia Liu, and Jian Hua Zhang. "Equipment Optimization Method of Electric Vehicle Fast Charging Station Based on Queuing Theory." Applied Mechanics and Materials 291-294 (February 2013): 872–77. http://dx.doi.org/10.4028/www.scientific.net/amm.291-294.872.

Повний текст джерела

Анотація:

As an important infrastructure of electric vehicles (EVs), EV fast charging station is of great significance in the popularization and development of EVs. Through the analysis of the characteristics of EV’s arriving time and charging duration in fast charging station, the stochastic service system was introduced and the queuing system model based on queuing theory was established. By calculating the indexes of the queuing system model, the desire model was used to optimize the number of EV chargers, which could save customers’ waiting time and reduce the investment of charging station. Finally, an example was simulated and calculated with MATLAB used as a simulation tool to verify the effectiveness of this approach.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Zhang, Hong Liang, Guang Hong Feng, Bao Shan Wang, Xu Ming Liu, and Xin Liu. "Application of Queuing Theory in Production Efficiency of Direct Rolling Process of Long Product." Materials Science Forum 977 (February 2020): 34–41. http://dx.doi.org/10.4028/www.scientific.net/msf.977.34.

Повний текст джерела

Анотація:

Based on the mathematical method of queuing theory, the queuing model of billets in the direct rolling process of the long product was established, which represented the conveying process of billets at the casting and rolling interface. Using the billets queuing model, the influence of different steel quantity, length, speed and other factors on the average waiting time of a single billet in the direct rolling production process was analyzed. Combined with the temperature drop of billets, the optimal average waiting time for a single billet was determined. The method improved the conveying connection efficiency of the casting-rolling interface and the direct rolling rate of billets.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Wang, Jian Ping, Xiao Min Li, and Cui Ling Jiao. "The Network Traffic Management Based on Queuing Theory." Applied Mechanics and Materials 121-126 (October 2011): 4721–25. http://dx.doi.org/10.4028/www.scientific.net/amm.121-126.4721.

Повний текст джерела

Анотація:

Traffic management can improve QoS of the network, the exist well-known algorithm for the network traffic management has some problems in the sensitive degree and the network reliability, using queuing theory build up the basic M/M/1 model for the network traffic management, obtaining the network traffic forecasting ways and the stable congestion rate formula, combining the general network traffic monitor parameters, realizing the estimation and monition process for the network traffic rationally. By testing the algorithm, we know that queuing theory can optimize the network traffic, it’s convenient and simple for calculating and monitoring the network traffic properly.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Usman Moyi, Aliyu, Kabir Bello Gamagiwa, Olayemi Joshua Ibidoja, and Garba Muhammad. "Application of Queuing Theory in a University Clinic." International Journal of Science for Global Sustainability 8, no. 1 (March 21, 2022): 9. http://dx.doi.org/10.57233/ijsgs.v8i1.338.

Повний текст джерела

Анотація:

Institutions such as banks, airlines, hospitals and telecommunication industries employ queuing theory to help in assisting the capacity levels needed to experience demand in a more optimized way for service improvement. In this article, we studied and employed the queuing theory activities of the Federal University Gusau Health Services Clinic. The distributions of patients’ arrival and service times were identified. The system was treated as a single, time-independent arrival with multiple service points. Based on the data obtained on the arrival and service processes, appropriate distributions were fitted and tested using the Chi-squared goodness of fit-test.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Zhang, Ying, Rui Song, and Na Hao. "Analysis of Passenger Queuing Behavior on Urban Rail Transit Platform during Rush Hour." Applied Mechanics and Materials 361-363 (August 2013): 1927–32. http://dx.doi.org/10.4028/www.scientific.net/amm.361-363.1927.

Повний текст джерела

Анотація:

Analyzing the passengers queuing behavior is powerful support of subway operation efficiency developing. Based on the three level pedestrian micro behavior theory, the decision process of passenger queuing behavior on urban rail transit platform is analyzed. The frame of passenger queuing behavior survey is put forward. The survey plan is designed. Finally, the quantitative analysis is performed which is on passengers queue selection, the time during the waiting and boarding stage.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Tsitsiashvili, Gurami. "Construction and Analysis of Queuing and Reliability Models Using Random Graphs." Mathematics 9, no. 19 (October 7, 2021): 2511. http://dx.doi.org/10.3390/math9192511.

Повний текст джерела

Анотація:

In this paper, the use of the construction of random processes on graphs allows us to expand the models of the theory of queuing and reliability by constructing. These problems are important because the emphasis on the legal component largely determines functioning of these models. The considered models are reliability and queuing. Reliability models arranged according to the modular principle and reliability networks in the form of planar graphs. The queuing models considered here are queuing networks with multi server nodes and failures, changing the parameters of the queuing system in a random environment with absorbing states, and the process of growth of a random network. This is determined by the possibility of using, as traditional probability methods, mathematical logic theorems, geometric images of a queuing network, dual graphs to planar graphs, and a solution to the Dirichlet problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

E. V., Kondrashova. "Investigation of Queuing Systems in System Structure Management." Financial Engineering 2 (February 28, 2024): 53–64. http://dx.doi.org/10.37394/232032.2024.2.6.

Повний текст джерела

Анотація:

Queuing theory is used to develop recommendations for constructing queuing systems efficiently, organizing the associated operations and functionalities, and regulating request flows for optimal performance. This paper presents a study of the income functional for two specific cases of controlled queuing systems: the M/G*/1/N* system for a controlled service duration and number of waiting spaces, and the G*/M/n/m queuing system with a controlled arrival flow. The construction of a controlled semi-Markov process and the construction of an income functional on its trajectories were used as the basis for this study. The task is to find the optimal control strategy in the given queuing systems. An algorithm for finding optimal strategies applicable to similar queuing systems to increase their functioning efficiency when controlling the system’s main characteristics was developed for both systems.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Lichtzinder, Boris Ya, and Igor A. Blatov. "POWER FOR PROCESSING APPLICATION FLOWS AND QUEUE SIZES IN MASS SERVICE SYSTEMS." T-Comm 14, no. 9 (2020): 10–16. http://dx.doi.org/10.36724/2072-8735-2020-14-9-10-16.

Повний текст джерела

Анотація:

The classical queuing theory studies time series processing under the assumption of sampling independence. However, the traffic of modern multiservice networks is usually strongly correlated and the methods of classical theory do not work. In this paper, we consider the cyclic process of queuing, conditional and unconditional mutual correlations. Conditional average values of queues are considered. The concept of processing power of the flow of applications in queuing systems (QS) is introduced. It is shown that the variable component of the indicated power is determined by the change in the load factor and corresponds to the conditional average size of the queue of applications in the QS.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Li, Yuheng. "Research on the queuing theory in practical applications." Applied and Computational Engineering 54, no. 1 (March 29, 2024): 41–47. http://dx.doi.org/10.54254/2755-2721/54/20241227.

Повний текст джерела

Анотація:

In the face of mounting global urbanization and digitization trends, the need for advanced tools for city planners and system managers becomes increasingly paramount to ensure seamless infrastructure operations. Among the arsenal of available tools, queuing theory emerges as a standout, offering invaluable predictions and strategies for a broad spectrum of situations. This article delves into the nuanced applications of queuing theory, with a specific lens on network communications and urban space planning. Drawing from a rich tapestry of academic sources, the narrative weaves together core principles to shape models that mirror real-world situations. At the heart of this exploration lies a deep dive into solutions that tackle network delay challenges, fine-tuning techniques for 6TiSCH resource allocation, and the subtle art of queue design at railway ticket counters. These instances highlight the adaptability and immediate relevance of queuing theory across various sectors. Those in the fields of design, system architecture, and urban planning will find this read enlightening. By leveraging the insights offered, decision-makers can pave the way for optimized system functionalities and heightened user experiences, vital in an era dominated by urban sprawl and digital transformation.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Komal, Kajal Garg, and Umesh Sharma. "IMPROVING SERVICE QUALITY OF DHABA WITH THE HELP OF QUEUING THEORY." Journal of Manufacturing Engineering 16, no. 3 (October 1, 2021): 082–86. http://dx.doi.org/10.37255/jme.v16i3pp082-086.

Повний текст джерела

Анотація:

Queuing theory is the mathematics of waiting lines. It is extremely useful in predicting and evaluating system performance. Queuing theory has been used for operations research, manufacturing and systems analysis The common problem arises in almost every famous dhaba is that they lose their customers due to a long wait on the line. Some dhaba provide extra chair for the customer to wait. But after waiting too long they leave. However, waiting chairs alone would not solve a problem when customers withdraw and go to the next dhaba. This causes a lot of loss to our dhaba. This shows a need of a numerical model for the restaurant management to understand the situation better. This paper aims to show that queuing theory satisfies the model when tested with a real-case scenario. Authors obtained the data from a “Gulshan Dhaba” in Hodal, Haryana. in order to derive the arrival rate, service rate, utilization rate, waiting time in queue and the probability of potential customers to balk. The collected data is analysed by using Little’s Theorem and M/M/1 queuing model. The arrival rate at “Gulshan Dhaba”, Hodal during its busiest period of the day is 2 customers per minute (cpm) while the service rate is 2.02 cpm during our study period. The average number of customers in the restaurant is 100 and the utilization period is 0.99.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!