Relevant bibliographies by topics / Queuing theory

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Queuing theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 June 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 'Queuing theory.'

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 "Queuing theory"

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.

Full text
Abstract:
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, and other styles
2

Umaira, Zareen, and Raza Saqlain. "Queuing Theory Diagnostic with Fuzzy Approach." International Journal of Innovative Science and Research Technology 7, no. 10 (October 22, 2022): 278–84. https://doi.org/10.5281/zenodo.7238335.

Full text
Abstract:
Queuing theory is a classical mathematical method to analyze the congestions and delays of waiting in line. It deals with number of customers waiting in line and many other aspects of queues. Our objective of the study has to develop a new fuzzy queuing model. The study intends to examine the long-run behavior and determination of the steadiness of queuing system. For this purpose the Buckley method has been applied. In this study Buckley method has extended using the trapezoidal shaped fuzzy numbers which are introduced to find the explicit formula for membership function of the fuzzy estimation to develop a new fuzzy queuing model. Fuzzy approach has been applied for measuring different linguistic factors in queuing systems. The results concluded that fuzzy queueing model is stable and bounds obtained by Buckley estimates are at least good as compare to bounds obtained by membership function.
APA, Harvard, Vancouver, ISO, and other styles
3

Srivastava, Riktesh. "Service Quality Control using Queuing Theory." International Journal of Advance Research and Innovation 11, no. 4 (December 31, 2023): 1–3. https://doi.org/10.69996/ijari.2023006.

Full text
Abstract:
When a service system is extremely busy, customers are forced to wait in line. In addition to decreasing consumer satisfaction, this issue results in financial losses for the organization. This research suggests a queue model of consumers' queuing behavior in order to account for consumer losses. Researchers are examining the best practices for queue formation and optimization in random service systems with the aim of reducing customer losses. The MG1, GM1, and GG1 queuing models were created to estimate the quality control of the service. We look into queueing systems that use customer behavior models to predict responses for service quality control. Although GM1 and GG1 findings are quite close to MG1 results, the investigation concluded that MG1 produces the highest quality service.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
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, and other styles
6

Liu, Junzhe. "Configuration of Electric Vehicle Charging Facilities Based on Queuing Theory." Theoretical and Natural Science 92, no. 1 (April 17, 2025): 129–33. https://doi.org/10.54254/2753-8818/2025.22038.

Full text
Abstract:
With the ongoing energy crisis, the development and utilization of clean energy is an issue that the world is increasingly confronted with. In addition, the number of electric vehicles in both domestic and international markets have steadily increased, making efficient charging solutions essential. Queueing theory provides an effective approach to optimizing charging station locations and capacity allocation, helping to minimize wait times, improve charging pile utilization, and meet electric vehicles charging demands. Research based on queueing models suggests that strategically allocating charging piles and refining queuing mechanisms, such as reservation systems or priority scheduling, can alleviate congestion and enhance service quality. Additionally, integrating queueing theory with energy storage technology enables electric vehicles charging stations to participate in grid dispatching. Through intelligent regulation, these stations can help balance power demand during peak hours, improving grid stability and addressing further challenges related to electric vehicles infrastructure. This work highlights the importance of queueing theory in optimizing the charging stations.
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
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, and other styles
8

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.

Full text
Abstract:
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, and other styles
9

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.

Full text
Abstract:
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, and other styles
10

Saini, Balveer, Dharamender Singh, and Kailash Chand Sharma. "Application of Queueing Theory to Analyze the Performance Metrics of Manufacturing Systems." Asian Research Journal of Mathematics 20, no. 12 (December 24, 2024): 84–95. https://doi.org/10.9734/arjom/2024/v20i12876.

Full text
Abstract:
Manufacturing is a processing medium used to transform raw materials into consumable finished goods. Manufacturing systems entail numerous interactions between personnel, data, supplies, and equipment. There is an urgent need for a queueing theory-based solution to handle the blocking and delay issues in production systems. The theory of queuing is a useful tool for analyzing and simulating the operation of production processes because it provides a variety of performance metrics, such as throughput, waiting time, and resource utilization. By considering the arrival pace of jobs and the service rate of different components, queuing models can offer valuable insights into the system's expected performance. The present study aims to analyze manufacturing systems within various frameworks, evaluate various performance metrics using the M/M/1 queueing techniques, and identify the optimal choice using typical optimization tools. We have described various performance metrics like utilization, throughput, cycle time, and queue length. To validated, we have calculated these performance metrics in practical situations. This project includes all intermediate steps required to create and include the product mechanism. The findings of this work have the potential to inspire future research directions, encouraging interdisciplinary collaborations and the development of innovative solutions. This work serves as a vital resource for academics, practitioners, and policymakers aiming to expand and improve the knowledge in Queueing Theory.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Queuing theory"

1

Wu, Kan. "New results in factory physics." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31650.

Full text
Abstract:
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Leon McGinnis; Committee Co-Chair: Bert Zwart; Committee Member: Antonius Dieker; Committee Member: Craig Tovey; Committee Member: Hayriye Ayhan; Committee Member: Mark Ferguson. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
2

Leontas, Angela Zoi. "Modeling queueing systems." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3101.

Full text
Abstract:
The thesis introduces the theory of queueing systems and demonstrates its applicability to real life problems. It discusses (1) Markovian property and measures of effectiveness with exponential interarrival and service times; (2) Erlang service times, and a single server; (3) different goodness-of-fit tests that can be used to determine whether the exponential distribution is appropriate for a given set of data. A single server queueing system with exponential interarrival times and Erlang service times is simulated using Visual Basic for Applications (VBA).
APA, Harvard, Vancouver, ISO, and other styles
3

Coyle, Andrew James. "Some problems in queueing theory." Title page, contents and summary only, 1989. http://web4.library.adelaide.edu.au/theses/09PH/09phc8812.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rumsewicz, Michael P. "Some contributions to the fields of insensitivity and queueing theory." Title page, contents and summary only, 1988. http://web4.library.adelaide.edu.au/theses/09PH/09phr938.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kumaran, Jayesh Liefvoort Appie van de. "Approximation models and approaches for computing performance measures that arise in single server queueing systems." Diss., UMK access, 2006.

Find full text
Abstract:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006.<br>"A dissertation in telecommunications networking and computer networking." Advisor: Appie van de Liefvoort. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Jan. 29, 2007. Includes bibliographical references (leaves 108-116). Online version of the print edition.
APA, Harvard, Vancouver, ISO, and other styles
6

Sabo, David Warren. "Closure methods for the single-server retrial queue." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26528.

Full text
Abstract:
This work focuses on the development and evaluation of so-called "closure methods" for solving the equations governing the time-dependent behaviour of single-server retrial queues. These methods involve assuming that particular known algebraic relationships between various characteristics of the corresponding steady-state queue also apply approximately when the queue is not at steady-state. The objective is to replace a problem requiring the solution of dozens or hundreds of simultaneous linear differential equations with a system of a few differential equations that has a solution that approximates those queue characteristics of immediate interest. The viability of such closure methods is assessed by examining the results of a series of test calculations. The methods described in this thesis apply to a retrial queue in which inter-arrival times for new customers, inter-retrial times, and service times are all assumed to be exponentially distributed. The steady-state solution for such a queue is described in some detail. A survey of the literature indicates that the description of this steady-state retrial queue has become quite sophisticated, whereas only very tentative steps have been taken in the study of the time-dependent behaviour of such queues. On the other hand, the time-dependent behaviour of the simple M/M/s queues have been studied to a much greater extent. The apparent value of closure methods in computing approximations to various basic time-dependent M/M/s queue characteristics motivated this examination of the extension of such methods to the single-server retrial queue. After discussing the basic approach to be used in devising and testing prospective closure methods for the single-server retrial queue, a variety of such methods is presented, with each being tested in considerable detail. It is found that three of the methods devised give results of comparable or better accuracy than those closure methods for the simple M/M/s queues which motivated this study. All recommended closure methods developed here involve systems of either two or three differential equations and permit the calculation of good approximations to four of the characteristics of greatest interest for non-stationary queues: the probability that the server is idle, the mean queue length, the variance of the queue length, and the conditional mean number of customers in the system given that the server is idle. Each of the methods presented is tested for queues with constant mean arrival, retrial and service rates, as well as for queues in which arrival and retrial rates vary sinusoidally with time.<br>Science, Faculty of<br>Mathematics, Department of<br>Graduate
APA, Harvard, Vancouver, ISO, and other styles
7

Chang, Woojin. "Asymptotics of k-limited polling models." Thesis, Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/25507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

程瑋琪 and Wai-ki Ching. "Construction of preconditioners for queueing networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B3121132X.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Srinivasan, Rengarajan Carleton University Dissertation Mathematics. "Topics in state dependent queues and queueing networks." Ottawa, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ching, Wai-ki. "Construction of preconditioners for queueing networks /." [Hong Kong] : University of Hong Kong, 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1378707X.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Queuing theory"

1

Johnston, Wilma Louise. Queuing theory. [s.l: The Author], 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Giambene, Giovanni. Queuing Theory and Telecommunications. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75973-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gnedenko, B. V., and I. N. Kovalenko. Introduction to Queuing Theory. Boston, MA: Birkhäuser Boston, 1989. http://dx.doi.org/10.1007/978-1-4615-9826-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Giambene, Giovanni. Queuing Theory and Telecommunications. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bocharov, P. P. Queueing theory. Utrecht: VSP, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kalashnikov, Vladimir V. Mathematical Methods in Queuing Theory. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Prabhu, N. U. Foundations of queueing theory. Boston: Kluwer Academic Publishers, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

S, Özekici, and Arab School on Science and Technology., eds. Queueing theory and applications. New York: Hemisphere Pub. Corp., 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Takagi, Hideaki. Queueing analysis. Amsterdam: North-Holland, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Thomopoulos, Nick T. Fundamentals of Queuing Systems: Statistical Methods for Analyzing Queuing Models. Boston, MA: Springer US, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Queuing theory"

1

Cheong, Michelle L. F., and Ma Nang Laik. "Queuing Theory." In Data and Decision Analytics for Business Operations, 267–97. Cham: Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-72255-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zonderland, Maartje E. "Basic Queuing Theory." In SpringerBriefs in Health Care Management and Economics, 13–26. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4899-7451-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Buckley, James J. "Fuzzy Queuing Theory." In Fuzzy Probabilities, 61–69. Heidelberg: Physica-Verlag HD, 2003. http://dx.doi.org/10.1007/978-3-642-86786-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Buckley, James J. "Fuzzy Queuing Theory." In Fuzzy Probabilities and Fuzzy Sets for Web Planning, 45–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-36426-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kalashnikov, Vladimir V. "Queueing Theory." In Mathematical Methods in Queuing Theory, 5–15. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Giambene, Giovanni. "Survey on Probability Theory." In Queuing Theory and Telecommunications, 265–317. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alfa, Attahiru Sule. "Single Node Queuing Models." In Queueing Theory for Telecommunications, 105–69. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-7314-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Giambene, Giovanni. "Markov Chains and Queuing Theory." In Queuing Theory and Telecommunications, 319–65. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Giambene, Giovanni. "Introduction to Telecommunication Networks." In Queuing Theory and Telecommunications, 3–60. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Giambene, Giovanni. "Legacy Digital Networks." In Queuing Theory and Telecommunications, 61–127. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Queuing theory"

1

Kavitha, K., S. Maragathasundari, K. Karthikeyan, and C. Swedheetha. "Optimizing Neural Machine Translation Workflows Using Queuing Theory." In 2025 International Conference on Visual Analytics and Data Visualization (ICVADV), 1272–77. IEEE, 2025. https://doi.org/10.1109/icvadv63329.2025.10961908.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Xie, Guoli, Yungui Chen, Jialun Fang, and Liwei Tian. "Transaction Latency in Blockchain Networks: Insights from Queuing Theory." In 2024 4th International Conference on Computer Science and Blockchain (CCSB), 589–92. IEEE, 2024. http://dx.doi.org/10.1109/ccsb63463.2024.10735545.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pan, Weibo, Sheng Li, Fei Li, Jun Zhang, and Chao Fang. "Performance Analysis of Kubernetes Job Scheduling Model Based on Queuing Theory." In 2024 IEEE 2nd International Conference on Sensors, Electronics and Computer Engineering (ICSECE), 592–95. IEEE, 2024. http://dx.doi.org/10.1109/icsece61636.2024.10729560.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhu, Junmin, Guangbin Xiao, and Qian Liu. "Electric Vehicle Charging and Discharging Scheduling Strategy Based on Queuing Theory." In 2023 International Conference on Information Processing and Network Provisioning (ICIPNP), 108–13. IEEE, 2023. https://doi.org/10.1109/icipnp62754.2023.00030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hasan, Kazi Ferdous, Aritra Das, Jannatul Ferdous Salma, Rashedul Amin Tuhin, Nahida Hoque, Ahmed Wasif Reza, and Mohammad Shamsul Arefin. "Load Balancing Algorithm: A Markov Chain Model Using Queuing Theory Approach." In 2024 International Conference on Innovations in Science, Engineering and Technology (ICISET), 1–6. IEEE, 2024. https://doi.org/10.1109/iciset62123.2024.11003920.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pandey, Vaibhav. "Cost-Optimized Predictive Autoscaling of Cloud Resources Using Game-Theoretic Queuing Theory." In SoutheastCon 2025, 481–87. IEEE, 2025. https://doi.org/10.1109/southeastcon56624.2025.10971700.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hohn, N., D. Veitch, K. Papagiannaki, and C. Diot. "Bridging router performance and queuing theory." In the joint international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1005686.1005728.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Biao, Xu, Chen Hao, Xianqiong Wu, Wu Wei, and Li Ce. "Journey Arrangements Based on Queuing Theory." In 2013 Fifth International Conference on Computational and Information Sciences (ICCIS). IEEE, 2013. http://dx.doi.org/10.1109/iccis.2013.183.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Usmanov, Vjacheslav, and Cenek Jarský. "Application of Queuing Theory in Construction." In 29th International Symposium on Automation and Robotics in Construction; Held jointly with the 8th World Conference of the International Society for Gerontechnology. International Association for Automation and Robotics in Construction (IAARC), 2012. http://dx.doi.org/10.22260/isarc2012/0048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lipsky, Lester, Dilip Tagare, and Edward Bigos. "Evaluation of queuing system parameters using linear algebraic queuing theory---an implementation." In the 1990 ACM SIGSMALL/PC symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/99412.99467.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Queuing theory"

1

Sullivan, Keith M., and Ian Grivell. QSIM: A Queueing Theory Model with Various Probability Distribution Functions. Fort Belvoir, VA: Defense Technical Information Center, March 2003. http://dx.doi.org/10.21236/ada414471.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wornel, Gregory W. Fractal Point Process and Queueing Theory and Application to Communication Networks. Fort Belvoir, VA: Defense Technical Information Center, December 1999. http://dx.doi.org/10.21236/ada375382.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Barbau, Raphael, and Conrad Bock. SysML Extension for Logistics Modeling and Analysis (SysLMA). Gaithersburg, MD: National Institute of Standards and Technology, 2025. https://doi.org/10.6028/nist.ir.8571.

Full text
Abstract:
Many engineers use analysis tools to predict behavior or find optimal values for properties of systems built to proposed designs, informing system design work by identifying cases where a design will perform incorrectly or in suboptimal ways. Design and analysis tools encode descriptions of systems in a variety of ways that are typically inconsistent, significantly reducing the overall engineering processes due to the additional effort resolving these problems. Systems engineering addresses this by establishing a single source for system descriptions, typically expressed in the Systems Modeling Language (SysML®). Systems engineering models intentionally do not cover all aspects of other engineering disciplines, but must integrate with their tools to prevent adding to inconsistency in engineering information. Coordinating systems information across engineering analysis this way requires automated translation between systems models and discipline-specific analysis tools, based on adding information in systems models needed for analysis. This report takes this approach for logistics analysis, which predicts and optimizes movement of separate things between activities that potentially modify them, in particular, multi-commodity flow optimization, queuing analysis, and discrete event simulation. The report presents a SysML extension for modeling systems to be analyzed, along with translation patterns to widely-used logistics analysis tools, examples of modeling logistics systems, as well as translation and analysis of these models.
APA, Harvard, Vancouver, ISO, and other styles
4

Shetty, Vyshnavi, Mycola Sauciur, and Anurag Pande. Investigating the Conversion of a Signalized Intersection to a Turbo Roundabout. Mineta Transportation Institute, March 2025. https://doi.org/10.31979/mti.2025.2233.

Full text
Abstract:
Turbo roundabouts are multilane roundabouts with helical pavement markings and raised structures. While they have seen widespread use in Europe, California is only the second state in the U.S. (after Florida) to have installed a turbo roundabout. Turbo roundabouts separate the ingress and circulating roadways. The concept was proposed and implemented in the Netherlands to mitigate congestion by improving traffic flow efficiency and addressing safety concerns on conventional multilane roundabouts. This research evaluates the first-ever turbo roundabout in California and compares its safety and operational performance with the previously existing 4-legged signalized intersection. The research team obtained safety and operational performance measures using well-calibrated simulation models and video analytics of the real-world conditions recorded before and after the installation of the turbo roundabout. The safety metrics include surrogate safety measures defining traffic conflicts between vehicles that enabled a quicker safety evaluation compared to multi-year collision data. The results show that the turbo roundabout effectively reduced crash potential and queuing delays at this site, meaning smoother,safer traffic flows. The real-world conflict data shows that more severe crossing and head-on conflicts (situations that could lead to collisions) of the previous 4-legged signalized intersection have all but been eliminated. The rear-end conflicts that do occur on the roundabout involve vehicles traveling at meaningfully reduced speeds compared to similar conflicts observed on the signalized intersection. The results show that turbo roundabouts may be an effective option at rural routes where the siting criteria for multilane roundabouts are satisfied. Given the timeline for this research project, the evaluation was conducted within months of the construction completion. It is therefore advised that Caltrans continue to monitor traffic crash data to ensure that the long-term crash data shows the expected improvement of safety. To support such evaluation, the counterfactual estimate of annual crash counts (i.e., the number of crashes that would have been expected had the intersection left as a signalized intersection) is provided in this study. The estimate provides a basis for comparison with future crash data to Caltrans. This study underscores the potential of turbo roundabouts to enhance roadway safety and operational performance,supporting their consideration in traffic management strategies across California and the nation.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Queuing theory' for particular source types:
Journal articles Dissertations / Theses Books
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