Journal articles: 'Queuing time'

1

Sun, Pey-Yuan, and Chen-Hsiu Laih. "Eliminate the Queuing Time in the New Suez Canal: Predicting Adjustment on Ships’ Arrival Time under Optimal Non-Queuing Toll Scheme." Journal of Marine Science and Engineering 9, no. 1 (2021): 70. http://dx.doi.org/10.3390/jmse9010070.

Full text

Abstract:

In 2016, the construction of the New Suez Canal was completed, enabling most large-size vessels to pass through and causing more ships to queue into the canal. As the queueing problem at the entrance of the canal was anticipated to be serious, an optimal non-queueing toll scheme was previously established to eliminate the queueing phenomenon at the anchorage of the canal. However, no information about each ship’s arrival time adjustment under the optimal non-queueing toll scheme is available from the previous literature. To solve this problem, we derive a series of mathematical formulae for each ship’s arrival time, length of queuing time and entry time before, and after, implementing the optimal non-queueing toll scheme. The arrival time adjustments, which enable ships to enter the canal without queueing, could then be obtained. These results enable the Suez Canal authorities to draw up the ship’s arrival timetable under the optimal non-queueing toll scheme, so that the captain could follow to enter the canal. The above information that we provide would be conducive to the management decision for the canal authorities to implement such a toll scheme. Once a tolled ship could enter the canal at the scheduled time without queueing, the ship owner could accurately control the sailing schedule, and the use of the ship could be more efficient.

APA, Harvard, Vancouver, ISO, and other styles

2

Sun, Pey-Yuan, and Chen-Hsiu Laih. "Eliminate the Queuing Time in the New Suez Canal: Predicting Adjustment on Ships’ Arrival Time under Optimal Non-Queuing Toll Scheme." Journal of Marine Science and Engineering 9, no. 1 (2021): 70. http://dx.doi.org/10.3390/jmse9010070.

Full text

Abstract:

In 2016, the construction of the New Suez Canal was completed, enabling most large-size vessels to pass through and causing more ships to queue into the canal. As the queueing problem at the entrance of the canal was anticipated to be serious, an optimal non-queueing toll scheme was previously established to eliminate the queueing phenomenon at the anchorage of the canal. However, no information about each ship’s arrival time adjustment under the optimal non-queueing toll scheme is available from the previous literature. To solve this problem, we derive a series of mathematical formulae for each ship’s arrival time, length of queuing time and entry time before, and after, implementing the optimal non-queueing toll scheme. The arrival time adjustments, which enable ships to enter the canal without queueing, could then be obtained. These results enable the Suez Canal authorities to draw up the ship’s arrival timetable under the optimal non-queueing toll scheme, so that the captain could follow to enter the canal. The above information that we provide would be conducive to the management decision for the canal authorities to implement such a toll scheme. Once a tolled ship could enter the canal at the scheduled time without queueing, the ship owner could accurately control the sailing schedule, and the use of the ship could be more efficient.

APA, Harvard, Vancouver, ISO, and other styles

3

Hu, Jun, Zhongwen Li, Lei You, Hong Zhang, Juan Wei, and Mei Li. "Simulation of queuing time in crowd evacuation by discrete time loss queuing method." International Journal of Modern Physics C 30, no. 08 (2019): 1950057. http://dx.doi.org/10.1142/s0129183119500578.

Full text

Abstract:

We have proposed a new evacuation model based on discrete time loss queuing method in order to effectively depict the queuing of pedestrians in an indoor space and its effect over evacuation performance. In this model, the calculation formula of pedestrian movement probability is given first based on field value and average queuing time; the average queuing time is depicted with the discrete time loss queuing method and the adopted evacuation strategy is set forth through defining cellular evolution process. Moreover, with the use of the established simulation platform for experiment, we have made a deep study of relations of parameters such as evacuation time, pedestrian density, exit number and average queuing time to obtain the pedestrian flow characteristic more in line with the reality. The result has shown that there is a great change in the evacuated population in the change of crowded state at the exit, and in the background of high population density, it is beneficial for reducing queuing time to prefer faraway exit to overcrowded exit for evacuation.

APA, Harvard, Vancouver, ISO, and other styles

4

Liang, Chih-Chin. "Enjoyable queuing and waiting time." Time & Society 28, no. 2 (2017): 543–66. http://dx.doi.org/10.1177/0961463x17702164.

Full text

Abstract:

Time theory studies abstractly argue that, depending on the customer experience, time spent waiting may be positive, negative, or even neutral, and it can affect the perceived passing of time and enjoyment of the overall customer experience. However, a company can manipulate customer perceptions of waiting time. Positive perceptions of waiting time can then be used for marketing purposes. Customer perceptions of waiting time can be reduced by making the queuing process enjoyable, by improving the waiting environment, and by making promotional activities enjoyable. To validate the aforementioned factors and develop the enjoyable queuing model, this study surveyed 1571 customers queuing at service companies in Taiwan, including 409 customers of upscale restaurants, 430 customers of restaurants, 439 customers of food stands, and 293 customers queuing at consumer electronics shops to purchase newly released iPhones. The applicability of the enjoyable queuing model was evaluated by partial least squares structural equation modeling, and group differences were evaluated by partial least squares multi-group analysis. The analytical results for each case and managerial implications are presented.

APA, Harvard, Vancouver, ISO, and other styles

5

Бронза, Семен Давыдович, Наталия Семеновна Юрчак, Ольга Александровна Гончарова, and Мурад Жораевич Овчиев. "Queuing time and utilization ratio in markov queuing systems." Eastern-European Journal of Enterprise Technologies 3, no. 4(69) (2014): 10. http://dx.doi.org/10.15587/1729-4061.2014.24901.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ruth Evangelin, K., and T. Dhikhi. "A Comparative Study of K-Erlang Distribution and M/M/1 Model in Cloud Computing." Asian Journal of Computer Science and Technology 4, no. 1 (2015): 40–43. http://dx.doi.org/10.51983/ajcst-2015.4.1.1743.

Full text

Abstract:

Cloud computing is a new emerging computing paradigm in which information and computer resources can beaccessed from Web browser by the users. Arriving customers who find the server busy may retry for service after a period of time in Queuing systems is a Retrial queue. If a new customer, after connected to the cloud service does not find any server free, the system automatically redirects the request towards a waiting queue. At that moment, if that waiting queue is also fully occupied by other customers, then the newly arrived customer has to retry for service after certain time period. This technique is known as Retrial queues. Priority of service request is an important issue because some requests have to be serviced earlier than others. These are requests which can’t stay for a long time in the queueing system. A comparative study on the waiting time of M/Ek/n ( n=1) and M/M/1 queuing system with cloud computing service station. This influences the queueing system to reduce the mean waiting time.

APA, Harvard, Vancouver, ISO, and other styles

7

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 (2024): 15–27. http://dx.doi.org/10.18844/gjcs.v14i1.9324.

Full text

Abstract:

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, and other styles

8

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

Full text

Abstract:

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, and other styles

9

Laih, Chen-Hsiu. "Maximizing Efficiency in the Suez Canal: A New Approach to Evaluate the Impact of Optimal Time-Varying Tolls on Ship Arrival Times." Journal of Marine Science and Engineering 12, no. 1 (2023): 76. http://dx.doi.org/10.3390/jmse12010076.

Full text

Abstract:

In the existing literature, an optimal time-varying toll scheme has been proposed for the Suez Canal to address the inefficiency of numerous ships queuing and waiting at the anchorage area to enter the canal. The primary objective of this tolling strategy is to alleviate the significant issue of ships queuing at the canal’s anchorage area. This stands in contrast to the current tolling system employed by the Suez Canal, which primarily aims to recover the management and operational costs associated with ship passage through the canal. However, the existing literature has yet to explore how the arrival times of ships at the anchorage area will change after implementing the optimal time-varying toll scheme. The goal is to ensure that the equilibrium cost of each tolled ship does not result in losses and achieve maximum efficiency in eliminating queueing at the anchorage area. To address this gap, this paper adopts the principle of cost equilibrium conservation and utilizes the Point-Slope Form to derive two mathematical formulas representing all ships’ post-toll arrival times at the anchorage area of the Suez Canal. These formulas are specifically derived for two categories of tolled ships: those that enter the canal earlier than the latest entry time regulated by the canal authorities and those that enter later. The derived formulas are concise and comparative, strengthening the theoretical underpinnings of the current pricing model for a queuing canal. Furthermore, they serve as valuable references for canal authorities in devising pertinent measures, such as organizing the scheduling of canal pilots, to facilitate the implementation of the optimal time-varying toll scheme.

APA, Harvard, Vancouver, ISO, and other styles

10

Kumala Jaya, Arsan, Akbar Hendra, Muhammad Sabirin Hadis, Muhammad Rizal, Randy Angriawan, and Annisa Nurul Puteri. "Development of Client Server-Based Queuing Applications at The Samsat Gowa Office." Ceddi Journal of Information System and Technology (JST) 1, no. 2 (2022): 14–23. http://dx.doi.org/10.56134/jst.v1i2.19.

Full text

Abstract:

The government has established a SAMSAT (One-Stop Manunggal Administration System) office which has duties in the motor vehicle tax service. Queuing activities make people spend their time waiting. Therefore, it is necessary to create a queuing system that can inform the estimated queue time remotely. The queuing system does not require users to wait physically, so the waiting time needed to queue can be used by taxpayers to carry out their own personal and work activities that are more useful. Queuing application development aims to develop queuing service features from previous applications which only provide queued information on taxpayers. Features developed in the form of queuing data processing with different activities, monitoring information on time and queue status periodically. The research method used is SDLC (Software Development Life Cycle) with a prototype model. The test results using the Gray Box Testing method show that queuing applications in government agencies providing motorized vehicle tax services have been successfully developed.

APA, Harvard, Vancouver, ISO, and other styles

11

Monike Febriyani Faris, Yuniar Farida, Dian C. Rini Novitasari, Nurissaidah Ulinnuha, and Moh Hafiyusholeh. "Implementation of The Open Jackson Queuing Network to Reduce Waiting Time." Jurnal Matematika MANTIK 6, no. 2 (2020): 83–92. http://dx.doi.org/10.15642/mantik.2020.6.2.83-92.

Full text

Abstract:

Waiting for service is a common thing in-hospital services. The more patients are waiting, the service delay increases, so waiting time in the queue gets longer. In health care in a hospital, a patient will queue several times in more than one queue in a hospital outpatient installation. The case study in this research is the queue system in the hospital's outpatient treatment, implementing an open Jackson queueing network to minimize waiting time. The workstations examined in this study were the registration, pre-consultation, and cardiology poly consultation, and pharmacy. The data is carried out for six days, counting the number of arrivals and departures with each point at intervals of 5 minutes. Applying the Jackson open queue network model, a recommendation was obtained for the hospital to increase employees' numbers. The registration workstation must have four servers; a poly cardiology workstation had three nurses and four doctors, while for pharmacy, had seven employees. With this personnel's addition, patients' total waiting time in the queuing system is approximately 12 minutes/patient. So, it can reduce waiting times in the queueing system that was initially 108 minutes/patient.

APA, Harvard, Vancouver, ISO, and other styles

12

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 (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

13

Dhumal, Priya Ramdas, Poonam Maruti Dumbare, Satyabhama Dnyanoba Mane, and Trushali Pandurang Sandbhor. "Parallel Patient Treatment Time Prediction Using Effective Queuing Recommendation System." Journal of Advances and Scholarly Researches in Allied Education 15, no. 2 (2018): 726–29. http://dx.doi.org/10.29070/15/57073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

Full text

Abstract:

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, and other styles

15

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

16

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.

Full text

Abstract:

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, and other styles

17

Binti Mohamad, Fazeeda, Nurul Shahadah Binti Osman Mydin, and Ahmad A.N.Aizat. "Reducing Ship Queuing Time in Port Operation: A Modelling and Simulation Approach." International Journal of Engineering & Technology 7, no. 3.20 (2018): 114. http://dx.doi.org/10.14419/ijet.v7i3.20.18992.

Full text

Abstract:

This study focuses on reducing queuing time in port operation by using discrete event simulation approach. This study was conducted to analyze the port operation activity in order to improve their performance in terms of time operation. A model was developed and simulated by mimicking the real port operation system using a case study. Two scenarios were experimented to see the effects or improvements in the queuing time of container loading and unloading activities. The result demonstrates the positive improvement on the queuing time for container to be loading and unloading.

APA, Harvard, Vancouver, ISO, and other styles

18

Lv, Shengli, and Jingbo Li. "The M/M/NRepairable Queueing System with Variable Breakdown Rates." Discrete Dynamics in Nature and Society 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/173407.

Full text

Abstract:

This paper considers the M/M/Nrepairable queuing system. The customers' arrival is a Poisson process. The servers are subject to breakdown according to Poisson processes with different rates in idle time and busy time, respectively. The breakdown servers are repaired by repairmen, and the repair time is an exponential distribution. Using probability generating function and transform method, we obtain the steady-state probabilities of the system states, the steady-state availability of the servers, and the mean queueing length of the model.

APA, Harvard, Vancouver, ISO, and other styles

19

Choirun Nisa, Nila, Alfian Wahyu, Aryo Samudra, and Rizal Fatoni. "MODEL SISTEM ANTRIAN UINSA MART MENGGUNAKAN POLA SINGLE CHANNEL SINGLE PHASE." Infotronik : Jurnal Teknologi Informasi dan Elektronika 9, no. 1 (2024): 12–18. http://dx.doi.org/10.32897/infotronik.2024.9.1.2669.

Full text

Abstract:

Simulation and modeling using a single channel single phase aims to optimize the cashier queuing system at Uinsa Mart. Queuing is a common phenomenon in everyday life where customers have to wait to get service. Delays in queues can affect the customer experience. This method uses literature studies, field studies, system implementation, and provides solutions. Observations were made to collect data regarding arrival time, service time, and other related variables. The data is processed and used as input to create a simulation model using Anylogic software. Queuing can be applied in the context of a canteen and provides recommendations for improving the queuing system at Uinsa Mart. Provides information about the observed queuing system, as well as the queuing model simulation that has been implemented. Provides further understanding of queuing system optimization and its application in the canteen context.

APA, Harvard, Vancouver, ISO, and other styles

20

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 (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

21

Neureuther, Brian D. "ESTIMATING CYCLE TIME IN COMPLEX JOB SHOPS." Journal of Integrated Design and Process Science: Transactions of the SDPS, Official Journal of the Society for Design and Process Science 6, no. 3 (2002): 93–104. http://dx.doi.org/10.3233/jid-2002-6306.

Full text

Abstract:

The development of Little's Law has been shown to give relatively precise and replicable estimates of the true cycle time in a variety of production (or network queuing) systems. The majority of the work performed using Little's Law has been done with queuing systems involving single products and single operations. However many queuing systems, such as semiconductor fabrication, are much more complex and involve several products with hundreds of operations. In this paper we compare the expected cycle time as computed by Little's Law to the actual cycle time determined from simulation analysis in a single and multiple product, multiple operation semiconductor fabrication system (a network queue environment). It was found that under simple environments, Little's Law works well. However, in complex job shop processes, such as semiconductor manufacturing, it does not. Factors that cause Little's Law to break down and the factors that are required to accurately estimate cycle time in complex job shops are addressed.

APA, Harvard, Vancouver, ISO, and other styles

22

Tarasov, V. N. "Queuing Systems with a Time Lag." INFORMACIONNYE TEHNOLOGII 27, no. 6 (2021): 291–98. http://dx.doi.org/10.17587/it.27.291-298.

Full text

Abstract:

The article discusses various queuing systems (QS) formed by four laws of probability distributions: exponential, hyperexponential, Erlang and hyper-Erlang of the second order. These four laws form sixteen different QS. In contrast to the classical theory, this article considers QS with distribution laws shifted to the right from the zero point. Such QS are of type G/G/1 with arbitrary laws of the distribution of intervals between the requirements of the input flow and the service time. As you know, for such systems it is impossible to obtain solutions for the main characteristic of QS the average waiting time in the general case. Therefore, studies of such systems are important for special cases of distribution laws. The article provides an overview of the author's results for the average waiting time in a queue in a closed form for systems with input distributions shifted to the right from the zero point. To solve this problem, the spectral decomposition method for solving the Lindley integral equation was used. In the course of solving the problem, spectral decompositions of the solution of the Lindley integral equation for eight systems were obtained and with their help calculation formulas were derived for the average waiting time in the queue. It is shown that in systems with delay, the average waiting time is shorter than in conventional systems. The obtained calculation formulas for the average waiting time expand and complement the well-known incomplete formula of the queuing theory for the average waiting time for G/G/1 systems. The proposed approach allows us to calculate the average value and moments of higher orders of waiting time for these systems in mathematical packages for a wide range of changes in traffic parameters. Given the fact that the variation in packet delay (jitter) in the telecommunications standard is defined as the spread of waiting time around its average value, the jitter can be determined through the variance of the waiting time.

APA, Harvard, Vancouver, ISO, and other styles

23

Al-Matar, Najeeb. "Analysis of Some Communication-Related Queuing System Modeling and Performance." Journal of System Engineering and Technological Innovation (JISTI) 2, no. 02 (2023): 131–38. http://dx.doi.org/10.38156/jisti.v2i02.51.

Full text

Abstract:

The paper presents research into the analysis of queuing systems in the context of communication, with the goal of creating precise models and evaluating their efficacy. The importance of queueing systems cannot be overstated in fields as disparate as telecommunications, computer networks, and the service sector. Analyzing how these systems function allows us to better allocate resources, boost performance, and provide a better experience for end users. The main goals are to create mathematical models that precisely capture the queuing behavior and to assess the effectiveness of these models in terms of metrics like queue length, waiting time, and system utilization. To do so, it is necessary to perform an extensive analysis of the relevant literature and theoretical frameworks. The properties of communication-related systems are examined, and many queuing models, including the M/M/1, M/M/c, and M/G/1, are modified accordingly. In addition, simulation methods are used to verify the accuracy of the suggested models and assess how they would fare in practical applications. The research yields useful information on the dynamics of queuing systems used in the field of communication. They show how changes to the arrival rate, service rate, and number of servers affect the system's most important performance indicators. Different scheduling policies, routing tactics, and resource allocation methodologies are also investigated to determine their impact on system performance.

APA, Harvard, Vancouver, ISO, and other styles

24

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 (2020): 5520–27. http://dx.doi.org/10.1166/jctn.2020.9448.

Full text

Abstract:

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, and other styles

25

Maala, Ronnel F. "QUEUING MANAGEMENT SYSTEM IN MANUEL S. ENVERGA UNIVERSITY FOUNDATION CANDELARIA INC." international journal of advanced research in computer science 14, no. 6 (2023): 44–53. http://dx.doi.org/10.26483/ijarcs.v14i6.7039.

Full text

Abstract:

Queue management in schools is becoming more and more important for improving the general student experience and making administrative tasks run more smoothly. This abstract shows everything you need to know about the Queuing Management System in Manuel S Enverga University Foundation Candelaria, Inc. In order to improve user satisfaction, shorten wait times, streamline the queuing process, and boost productivity, this study examines the use and impact of queueing management systems in educational institutions. By digitiizing the queuing process, these systems offer several benefits. Students can join virtual queues, eliminating the need to physically wait in line, which saves them time and enhances their satisfaction with administrative processes. Instead of focusing their efforts on staffing lines, faculty and administrative personnel can handle queues more effectively and help students. The technique also improves data accuracy and offers insightful information about queue patterns, which aids in the decision-making process for schools looking to improve services. Delivering a fully functional and flexible Queue Management System that greatly improves the effectiveness of queue management across multiple lines and apps on campus is the primary objective of this study.

APA, Harvard, Vancouver, ISO, and other styles

26

Mickevičius, Giedrius, and Eimutis Valakevičius. "MODELLING OF NON‐MARKOVIAN QUEUING SYSTEMS." Technological and Economic Development of Economy 12, no. 4 (2006): 295–300. http://dx.doi.org/10.3846/13928619.2006.9637757.

Full text

Abstract:

The purpose of this paper is to suggest a method and software for evaluating queuing approximations. A numerical queuing model with priorities is used to explore the behaviour of exponential phase‐type approximation of service‐time distribution. The performance of queuing systems described in the event language is used for generating the set of states and transition matrix between them. Two examples of numerical models are presented - a queuing system model with priorities and a queuing system model with quality control.

APA, Harvard, Vancouver, ISO, and other styles

27

Bahariandi Aji Prasetyo, Elsya Paskaria Loyda Tarigan, and Sri Zetli. "Pemodelan Simulasi untuk Mengurangi Antrian pada Fasilitas Layanan Kesehatan." Jurnal Surya Teknika 10, no. 2 (2023): 912–16. http://dx.doi.org/10.37859/jst.v10i2.6611.

Full text

Abstract:

Service is the main indicator of the sustainability of a service. The quality of services is the main factor that must be considered in maintaining the existence and competition of services, including health facility services. This research was conducted at one of the health service providers in the city of Batam. One aspect of health service quality is queuing service. Therefore, the quality of service in the queuing system in health facilities is an interesting thing to research. This research measures the level of optimality of the queuing system currently in effect at the Saffira Mitra Medika clinic. The measurement focuses on service time, the number of patients served, and the waiting time for patients to be served in the queue system. The results of measuring the current queuing system are compared with other proposed queuing system scenarios, so that the level of patient satisfaction as customers is met. The proposed queuing system was obtained through a simulation approach, with the help of Flexsim software. A simulation approach was chosen to facilitate modeling in the proposed queuing system

APA, Harvard, Vancouver, ISO, and other styles

28

Sianipar, Thesion Marta, Halim Arif Cahyono, and Amalia Nur Alifah. "Analisis dan Simulasi Teori Antrian pada Indomaret Darmo Surabaya." PROSIDING SEMINAR NASIONAL SAINS DATA 3, no. 1 (2023): 313–19. http://dx.doi.org/10.33005/senada.v3i1.128.

Full text

Abstract:

Abstract: Service quality is one of the key factors to get a good rating from consumers. However, an increase in the number of consumers is sometimes not matched by an increase in the number of service providers. This is what causes the queue. Queuing theory provides several alternative mathematical models that can be used to determine some of the properties of a queuing system and optimize decision making. For this reason, queuing theory simulation is one of the important things to do so that the service system in one place can be optimal. In this research, analysis and simulation of queuing theory will be carried out at Indomaret Darmo Surabaya. The data used are primary data taken directly by researchers. In this study, the results of queuing theory analysis will be displayed in several forms of data visualization and determine the confidence intervals of service duration, service waiting time, and idle time. The results show that the service duration at Indomaret Darmo Surabaya can be trusted to be between 4.48 to 5.128 minutes. While the average waiting time can be trusted to be between 3,974 to 5,505 minutes. In addition, the results of the analysis show that the average, median, mode, and standard deviation of idle time are 0 (less than 1 minute). This shows that there is almost no free time for services at Indomaret Darmo Surabaya. Keywords: idle time, queuing theory, service duration, waiting time

APA, Harvard, Vancouver, ISO, and other styles

29

Luo, Li, Hangjiang Liu, Huchang Liao, Shijun Tang, Yingkang Shi, and Huili Guo. "Discrete Event Simulation Models for CT Examination Queuing in West China Hospital." Computational and Mathematical Methods in Medicine 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/2731675.

Full text

Abstract:

In CT examination, the emergency patients (EPs) have highest priorities in the queuing system and thus the general patients (GPs) have to wait for a long time. This leads to a low degree of satisfaction of the whole patients. The aim of this study is to improve the patients’ satisfaction by designing new queuing strategies for CT examination. We divide the EPs into urgent type and emergency type and then design two queuing strategies: one is that the urgent patients (UPs) wedge into the GPs’ queue with fixed interval (fixed priority model) and the other is that the patients have dynamic priorities for queuing (dynamic priority model). Based on the data from Radiology Information Database (RID) of West China Hospital (WCH), we develop some discrete event simulation models for CT examination according to the designed strategies. We compare the performance of different strategies on the basis of the simulation results. The strategy that patients have dynamic priorities for queuing makes the waiting time of GPs decrease by 13 minutes and the degree of satisfaction increase by 40.6%. We design a more reasonable CT examination queuing strategy to decrease patients’ waiting time and increase their satisfaction degrees.

APA, Harvard, Vancouver, ISO, and other styles

30

Lee, Chul Ki, Deog Kyoon Jeong, and Yong Chul Shim. "Virtual minimum potential queuing." Journal of High Speed Networks 16, no. 4 (2007): 323–39. https://doi.org/10.3233/hsn-2007-323.

Full text

Abstract:

We propose Virtual Minimum Potential Queuing (VMPQ) which provides a simple virtual time update function with O(1) complexity. While Weighted Fair Queuing (WFQ) provides low latency and good fairness, the virtual time update function has O(V) complexity for serving V busy flows. Start Potential Fair Queuing (SPFQ), which updates virtual time with a reduced complexity of O(log V), provides a fairness index very close to WFQ. Some other algorithms reduce virtual time update complexity further, but they degrade the fairness index significantly. VMPQ recalibrates virtual time using a virtual minimum potential, which is calculated with only a pre-computed constant and the finish time of the packet selected for transmission. This method requires O(1) complexity for the recalibration. Additionally, it does not affect the maximum latency and keeps fairness index to be almost identical to SPFQ.

APA, Harvard, Vancouver, ISO, and other styles

31

Muhammad, Aristo Indrajaya, Fauzi Rizana, Asmi Rahman Yuli, and Yudhaswana Joefrie Yuri. "Comparative performance analysis of different queuing techniques for campus area network." Comparative performance analysis of different queuing techniques for campus area network 32, no. 1 (2023): 403–12. https://doi.org/10.11591/ijeecs.v32.i1.pp403-412.

Full text

Abstract:

A quality network infrastructure is a user demand for the increment of traffic nowadays. Due to data traffic congestion, a network’s service quality cannot fulfill the user demand, especially for streaming-type traffic. For this, an appropriate queuing method can be a convenient solution for network congestion at the time of picking traffic load. In this paper, a simulation was conducted using the OPNET application to examine the feasibility of three types of queuing methods, namely first in first out (FIFO), priority queuing (PQ), and weighted fair queuing (WFQ). During the simulation, several important parameters such as delay, throughput, and response time are considered as performance metrics and compared among four types of applications as file transfer protocol (FTP), hypertext transfer protocol (HTTP), voice over internet protocol (VoIP), and video conferencing. According to the result, it is observed that WFQ provides comparatively improved results than PQ and FIFO.

APA, Harvard, Vancouver, ISO, and other styles

32

R. Sherine Jenny, N. Sugirtham,. "IMPACT OF QUEUING DISCIPLINES ON THE PERFORMANCE OF MULTI-CLASS TRAFFIC IN A NETWORK." INFORMATION TECHNOLOGY IN INDUSTRY 9, no. 1 (2021): 698–703. http://dx.doi.org/10.17762/itii.v9i1.189.

Full text

Abstract:

Network applications demand quality of service for enhanced call quality and increased user satisfaction. Hence, implementing queuing discipline at switches and routers in a network will govern the way packets are buffered while waiting for transmission. Queuing disciplines like first-in first-out (FIFO) queuing, priority queuing (PQ), weighted-fair queuing (WFQ), custom queuing and modified weighted round robin are more prominently deployed in network applications. These queuing disciplines help to control and manage network resources by fixing priorities for specific types of data on the network. The paper aims to analyze the quality of service parameters for various real time applications like File transfer protocol(FTP), email, database, Voice over IP(VOIP), video and web browsing,etc., and helps to optimise the use of available network resources. Moreover the quality of the network is compared using different QoS parameters such as end-to-end delay, throughput, jitter and Mean Opinion Score (MOS). This paper focuses on various queuing disciplines with low and high network traffic.

APA, Harvard, Vancouver, ISO, and other styles

33

R. Sherine Jenny, N. Sugirtham,. "IMPACT OF QUEUING DISCIPLINES ON THE PERFORMANCE OF MULTI-CLASS TRAFFIC IN A NETWORK." INFORMATION TECHNOLOGY IN INDUSTRY 9, no. 1 (2021): 691–97. http://dx.doi.org/10.17762/itii.v9i1.188.

Full text

Abstract:

Network applications demand quality of service for enhanced call quality and increased user satisfaction. Hence, implementing queuing discipline at switches and routers in a network will govern the way packets are buffered while waiting for transmission. Queuing disciplines like first-in first-out (FIFO) queuing, priority queuing (PQ), weighted-fair queuing (WFQ), custom queuing and modified weighted round robin are more prominently deployed in network applications. These queuing disciplines help to control and manage network resources by fixing priorities for specific types of data on the network. The paper aims to analyze the quality of service parameters for various real time applications like File transfer protocol(FTP), email, database, Voice over IP(VOIP), video and web browsing,etc., and helps to optimise the use of available network resources. Moreover the quality of the network is compared using different QoS parameters such as end-to-end delay, throughput, jitter and Mean Opinion Score (MOS). This paper focuses on various queuing disciplines with low and high network traffic.

APA, Harvard, Vancouver, ISO, and other styles

34

Yin, Mingang, Ming Yan, Yu Guo, and Minghe Liu. "Analysis of a Pre-Emptive Two-Priority Queuing System with Impatient Customers and Heterogeneous Servers." Mathematics 11, no. 18 (2023): 3878. http://dx.doi.org/10.3390/math11183878.

Full text

Abstract:

This paper presents a queuing system model that incorporates multiple priorities, multiple abandonments, and heterogeneous servers. Waiting for service easily leads to impatient behaviors. The impact of two kinds of impatient behaviors, balking and reneging, on queueing system performance is examined. The problem is formulated as continuous-time Markov chains. It also introduces a special state called the non-sojourn state to record the number of customers who abandon the system. The state transition rate matrix is transformed into a block tridiagonal matrix by appropriately setting the state numbers. A novel indicator called interstate transition frequency is proposed, which aids in distinguishing state transitions during the system evaluation process. Based on the interstate transition frequency, a set of indicators is derived to offer additional analytical perspectives for the queuing system. Finally, the proposed model is applied to an automobile repair shop to validate its effectiveness in practical scenarios.

APA, Harvard, Vancouver, ISO, and other styles

35

M.GEETHA. "A comparative study of queuing models in toll plaza." International Journal of Science and Research Archive 13, no. 1 (2024): 2177–80. http://dx.doi.org/10.30574/ijsra.2024.13.1.1763.

Full text

Abstract:

This paper analyze the collected data of a toll plaza before and after the implementation of FASTag using queuing theory by single server queuing model and multi-server queuing model and thus to find out if the implementation of FASTag has reduced the waiting time and increased the system efficiency.

APA, Harvard, Vancouver, ISO, and other styles

36

Purnomo, Bambang Herry, Bertung Suryadharma, and Nurma Yunita Ekasari. "MODEL SISTEM ANTRIAN PADA PELAYANAN RESTORAN CEPAT SAJI (Studi Kasus di KFC Gajah Mada Kabupaten Jember)." JURNAL AGROTEKNOLOGI 15, no. 01 (2021): 40. http://dx.doi.org/10.19184/j-agt.v15i01.19929.

Full text

Abstract:

KFC is one of the fast food restaurants in the Jember Regency which is never deserted of visitors, especially that on Gajah Mada Street. The purposes of this study were to determine the characteristics of the queuing system, analyze the queuing applied at KFC, formulate recommendations for improving the queuing system to reduce queuing, and minimize costs. The Data analysis was performed to compare manual calculations and simulation methods using ARENA 14.0. The characteristics of the current queue at KFC are random and unlimited arrival patterns, FIFO (first in first out) queue discipline, and the design of the single phase multi channel queuing system. The queuing distribution used for arrival and service time was the exponential distribution. The queuing model notation at the M/M/2 cashier: FIFO/∞/∞. The recommended queuing model that can be applied was to add 1 cashier to 3 cashiers at a cost of Rp 150,560 from the scenario made. The performance variable in the scenario becomes less than the initial condition, which was ρ cashier becomes 188%, total Wq about 0.92 minutes, and Lq about 2 people. Adding these facilities changes the queuing model notation to (M/M/3: FIFO/∞/∞). Keywords: ARENA, FIFO queuing discipline KFC Jember, queuing system

APA, Harvard, Vancouver, ISO, and other styles

37

Pratama, Nasrulloh Tegar, and Aditia Sovia P. "M/M/1/FCFS/~ /~ QUEUE MODEL SIMULATION WITH EXCEL." JOCSIT .:. Journal of Collaborative Science and Informatics Technology 1, no. 1 (2024): 55–64. http://dx.doi.org/10.69933/jocsit.v1i1.67.

Full text

Abstract:

Queuing Theory is a conceptual framework used to analyze and optimize the queuing or waiting process in the context of a service system. In queuing theory, customers arrive at the service server from a source, where they can immediately start service or wait in a queue if the server is busy. Once service is complete, the server automatically serves the next customer in the queue. In queuing analysis, customer arrival time is represented by the inter-arrival interval while service is measured by service time per customer. Even though queuing theory is a simple method, it can become complex if done manually because it requires high accuracy. Using Microsoft Excel is the right tool because it makes it easier to carry out calculations accurately. Excel displays the calculation results in spreadsheet form so that the calculation stages can be more easily understood..

APA, Harvard, Vancouver, ISO, and other styles

38

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 (2020): 33–48. http://dx.doi.org/10.4018/ijec.2020070103.

Full text

Abstract:

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, and other styles

39

Rambe, Aida Zahrah Hasanati Br, Fatimah Zahra Rambe, Jihan Azzahra, Lidia Sartika Gultom, and Putri Chairunnisa. "Analisis Model Antrian Multi Channel-Single Phase Pada Doorsmeer Mobil dengan Menggunakan Software POM-QM for Windows." Indo-MathEdu Intellectuals Journal 5, no. 1 (2024): 602–11. http://dx.doi.org/10.54373/imeij.v5i1.780.

Full text

Abstract:

Queuing is the activity of a group of people or goods in a waiting line to wait for a service. The queueing system can be interpreted as the arrival of customers for a service, waiting to get service, and leaving the system after getting service. This research is applied research using the observation method. This research aims to provide solutions to queuing problems at Agung Auto Service car doorsmer Jl. S.M. Raja No. 3, Rantauprapat, North Sumatra. Data is taken by paying attention to the time of arrival of customers and how many customers can be served. This car doorman applies the First Come, First Served (FCFS) discipline, where the first customer to arrive will get the first service through the queuing process. Therefore, the model that can be used is the multi-channel single-phase model, where there are two or more service facilities flowed by a single queue. From the results of the calculation of the model simulation in POM-QM for Windows, it can be seen that the performance of the service system at the Agung Auto Service car doorsmeer is not optimal because initially there were only 3 service servers, causing queues. Therefore, it is necessary to add up to six service servers to produce optimal service

APA, Harvard, Vancouver, ISO, and other styles

40

Anbiya, Muhammad Primasuri, Ibrahim Ibrahim, and Ayu Putri Purwani. "Model Sistem Antrean Menggunakan Pola Single Channel-Single Phase Dengan Promodel Pada Antrean SPBU 34.31349 Karawang, Jawa Barat." Industrika : Jurnal Ilmiah Teknik Industri 8, no. 4 (2024): 834–44. https://doi.org/10.37090/indstrk.v8i4.1704.

Full text

Abstract:

This study aims to optimize the queuing system at SPBU 34.41349 Karawang, Jawa Barat by using a single channel-single phase pattern model using ProModel software. An efficient and effective queuing system is essential to minimize customer waiting time and increase customer satisfaction. In this study, analyzed queue data at SPBU 34.41349 to understand the characteristics of queues and modeled them using ProModel. Identify factors affecting customer wait times and estimate queuing system performance based on simulations performed with ProModel. The results showed that the productivity rate of operators was 96% and the unemployment rate was 4%. This shows that the operator's productivity level is quite good. However, because there is only 1 filling station for motor vehicles, the type of pertalite fuel causes a buildup of queues. Therefore, to reduce queuing time and maximize service is to add one counter on each server which is expected to increase the efficiency and effectiveness of the queuing system at SPBU 34.41349 Karawang, West Java. Keywords: Promodel, Queuing system, Single channel, Statistical test

APA, Harvard, Vancouver, ISO, and other styles

41

Fauzy, Taufik Rachmad, Dwi Mei Riya Ristanti, and Eko Sumariyono. "Designing Improvement of Service effectiveness Using M/M/1 and M/M/S Queue Models (Case Study: Customer Arrivals at Jatim Park Tourist Destination During Holidays and Peak Hours)." Tibuana 7, no. 2 (2024): 107–11. http://dx.doi.org/10.36456/tibuana.7.2.9360.107-111.

Full text

Abstract:

Queueing is a collection of people lined up with the purpose of waiting to be served, after which they leave the queue. Queuing activities often arise due to ineffective or suboptimal service times, resulting in longer wait times. To maximize and schedule service time optimally, queueing models such as M/M/1 and M/M/S systems are utilized. This study applies these models to analyze the queuing system at Jatim Park tourist destination. The aim of this research is to determine the effectiveness of service at the ticketing counters of Jatim Park during holidays. To initiate the study, data was collected on visitor arrival times and average service times. The data analysis aims to optimize service effectiveness at the Kampung Coklat tourist area by implementing the FCFS (First Come, First Served) queueing method and the M/M/S system. The findings suggest that the optimal number of teller servers needed to serve visitors effectively is 2. The analysis also identifies that the longest queue occurs between 10:00 AM and 11:00 AM, with 3 visitors waiting at its peak. The average number of visitors in the queue during this period is approximately 1.3 or 1 visitor. Based on these results, the study concludes that the service effectiveness at the Kampung Coklat tourist area is sufficiently optimized.

APA, Harvard, Vancouver, ISO, and other styles

42

SUGIARI, KADEK DITA, I. WAYAN SUMARJAYA, and KETUT JAYANEGARA. "ANALISIS SISTEM ANTREAN PADA LOKET PENDAFTARAN POLIKLINIK SPESIALIS DI RS BALIMED." E-Jurnal Matematika 10, no. 2 (2021): 70. http://dx.doi.org/10.24843/mtk.2021.v10.i02.p323.

Full text

Abstract:

Hospital is one of the service facilities that is not free from queue problem. One example of this hospital is Balimed Hospital. At certain times, especially in the morning, there is a lineup of patients at the Balimed Hospital’s Specialist Polyclinic. In order to maximize service, it is necessary to analyze the queuing system by applying the queuing theory. This study focuses on queues at the Balimed Hospital’s Specialist Polyclinic in Internal Disease. After conducting the research, it was found that the model used at the Specialist Polyclinic in Internal Disease is . With this model, the queuing system at Balimed Hospital's Specialist Polyclinic in Internal Disease is in steady state condition because ???? < 1. The measures of performance for queuing system at Balimed Hospital’s Specialist Polyclinic in Internal Disease is the average number of patients in queue is 0,1 patient or it can be said that there is almost no patient in queue because the value of is close to 0, the average number of patients in system is 1 patient, the average waiting time for patients in queue is 1 minute, and the average time spent by patients start from queuing until being served is 2,5 minutes. The queuing system has been effective, it can be seen from the short waiting time for patients.

APA, Harvard, Vancouver, ISO, and other styles

43

Alam, Nur. "INTEGRATION OF MOBILE BASED QUEUING SYSTEMS." Journal of Information Technology and Its Utilization 1, no. 2 (2018): 54. http://dx.doi.org/10.30818/jitu.1.2.1880.

Full text

Abstract:

The amount of time and energy that is wasted if people queue for public services is a serious problem. More ever if that queuing done by busy or sick people. Because of busyness, a person sometimes has to complete several matters at different places in short period of time. Therefore we need a queuing system that is able to integrate all queuing services so that the public can do all queuing processes with more comfort without having to cram into a queue. In addition, by integrating all community queuing services can get services in several places just by registering through one application. The working system of this application is to distribute information on service position and estimated waiting time through an application. To design the system, a survey was carried out in several public service facilities in the cities of Makassar and Gowa Regency. Beside that, literature studies also were carried out on similar papers. System analysis and design using the SDLC method include planning, system analysis and system design. It is expected that the results of this design can become a model that can be used as an appropriate reference to implement integration of mobile-based online queuing systems.

APA, Harvard, Vancouver, ISO, and other styles

44

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 (2021): 884–92. https://doi.org/10.11591/ijeecs.v22.i2.pp884-892.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

45

Perepelkin, Evgenii Alexandrovich. "Robust control of discrete-time queuing system." Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tekhnika i informatika, no. 51 (June 1, 2020): 4–9. http://dx.doi.org/10.17223/19988605/51/1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Idris, Husni, John-Paul Clarke, Rani Bhuva, and Laura Kang. "Queuing Model for Taxi-Out Time Estimation." Air Traffic Control Quarterly 10, no. 1 (2002): 1–22. http://dx.doi.org/10.2514/atcq.10.1.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Carlucci, Gaetano, Luca De Cicco, and Saverio Mascolo. "Controlling queuing delays for real-time communication." ACM SIGCOMM Computer Communication Review 46, no. 3 (2018): 1–7. http://dx.doi.org/10.1145/3243157.3243158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Flick, Allen, and Ming Liao. "A queuing system with time varying rates." Statistics & Probability Letters 80, no. 5-6 (2010): 386–89. http://dx.doi.org/10.1016/j.spl.2009.11.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Immaculate, S., and P. Rajendran. "Analysis of the Economic Cost of Coxian-2 Service with Encouraged Arrival and Balking." International Journal of Analysis and Applications 22 (March 4, 2024): 41. http://dx.doi.org/10.28924/2291-8639-22-2024-41.

Full text

Abstract:

The queuing model is widely used in the production, inventory, and service industries. In order to improve the performance of a queuing model, it is crucial to characterize the practical queuing characteristics. The purpose of this work is to examine an analysis of the economic cost of Coxian-2 service with encouraged arrival and balking in a queuing system. In particular, we discussed Coxian-2 service-encouraged arrival queuing system and an accelerated distribution. According to our presumption, units (customers) enter the system one at a time in an encouraged arrival procedure, and the server offers Coxian-2 service one at a time according to the first in first out (FIFO) rule. As probability-generating functions, the typical customer count, and the typical customer wait time in the system and queue, respectively. We also derive steady-state probabilities and performance measures for the proposed model. Finally, the economic analysis of the model is performed by introducing cost model with an empirical example is given to show the effectiveness of the proposed model. The created formula also fulfills Little’s formula.

APA, Harvard, Vancouver, ISO, and other styles

50

A. Elkasrawy, Mohamed, Ahmed Hassan, Sameh O. Abdellatif, Gamal Abdel Shafy Ebrahim, and Hani A. Ghali. "Prototyping Design and Optimization of Smart Electric Vehicles/Stations System using ANN." International journal of electrical and computer engineering systems 13, no. 6 (2022): 485–91. http://dx.doi.org/10.32985/ijeces.13.6.8.

Full text

Abstract:

This paper demonstrates an experimental attempt to prototype electric vehicle charging station’s (EVCS) decision-making unit, using artificial neural network (ANN) algorithm. The algorithm acts to minimize the queuing delay in the station, with respect to the vehicle state of charge (SOC), and the expected arrival time. A simplified circuit model has been used to prototype the proposed algorithm, to minimize the overall queuing delay. Herein, the worst-case scenario is considered by having number of electric vehicles arriving to the station at the same time greater than the charging points available in the station side. Accordingly, the optimization technique was applied to reduce the mean charging time of the vehicles and minimize queuing delay. Results showed that this model can help in reducing the queuing delay by around 20% of the mean charging time of the station, while referring to a bare model without ANN algorithm as a reference.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Queuing time'

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