Search

The cross-regional spread of epidemics, such as COVID-19, poses significant challenges due to the spillover of false-negative individuals resulting from incubation periods, detection errors, and individual irrationality. This study develops a stylized model to address the trade-offs faced by the planner in designing optimal lockdown policies: curbing the cross-regional spread of epidemics while balancing economic costs and ensuring long-term sustainability. The model integrates a queuing network to calculate the influx of false-negative cases, which more accurately reflects real-world scenarios and captures the complexity of regional interactions during an outbreak. Subsequently, a SIR network is used to estimate the spread of infections. Unlike similar studies, our approach focuses specifically on the cross-regional dynamics of epidemic spread and the formulation of optimal lockdown policies that consider both public health and economic impacts. By optimizing the lockdown threshold, the model aims to minimize the total costs associated with lockdown implementation and infection spread. Our theoretical and numerical results underscore the crucial role of timely nucleic acid testing in reducing infection rates and highlight the delicate balance between public health benefits and economic sustainability. These findings provide valuable insights for developing sustainable epidemic management strategies. [ABSTRACT FROM AUTHOR]

This paper presents a queueing system that considers impatient customers and multiple vacation periods. This study uses the Mt/M/1 model and assumes that customers' impatience is related to the server's vacation. The system being analyzed exhibits exponential service times and arrival processes that follow a periodic (sinusoidal) Poisson distribution. The system under consideration has exponential service times and periodic (sinusoidal) Poisson arrival processes. We studied a novel analysis of an Mt/M/1 model including simultaneous vacations and impatient customers alongside the relative amplitude changes. The time-dependent probability generating functions and their associated steady-state solutions have been derived explicitly. The pointwise stationary approximation is utilized to calculate long-term average effectiveness sizes performance metrics. We focus on five performance measures: the expected number of customers waiting in the queue during vacation, the expected customer waiting time in the queue during vacation, the probability of the server being busy, the probability of the server being on vacation and the probability of customers' impatience. Finally, we perform a sensitivity analysis using simulations to evaluate the parameters. [ABSTRACT FROM AUTHOR]

Torn between desire and hope, patience and impatience, those waiting for change in Morocco have, since independence, been articulating their rejection of the way the queues of dignity and social justice are getting intolerably static and crowded. This article reasons with cultural and socio-political gradations of waiting in the Muslim and Moroccan tradition to discuss how the dynamics of waiting and not waiting reflect the poor people's methods of tolerating or challenging the prevailing truth. We theoretically and empirically make sense of the way political stagnancy and social nothingness culminate into what we call a state of (asitism) or (as-it-is-ism), a proponent as it were of obdurate stagnancy, deferral of personal and collective expectations, and persistence of social plights and economic ills, that are continuously informed and challenged by waiting and non-waiting protocols. To get to grips with asitism as a conceptual tool and ontological phenomenon, this article takes into consideration how and why the subjects revolt, whether it be by seeking migration opportunities to Europe; by illegally crossing the borders; or by otherwise expressing their denunciation of the way politicians seek to dupe them into more waiting. However, even when they refuse to wait for the promises politicians make to be verified as truthful or fake by not taking part in the elections or by boycotting a particular party, we contend that they simply deploy the time they have for a different wait, hence re-organising themselves in a different queuing order. [ABSTRACT FROM AUTHOR]

This study considers a single server Markovian queueing system with a second optional service and service interruptions. The service is interrupted during the busy period of both the first essential service and the second optional service. The customer whose service is hindered needs to go through the process from the earliest starting point on consummation of interference or continued from where it has halted. In light of the linear reward cost structure, the customer's joining strategies are investigated in two cases; in particular, fully unobservable and almost unobservable, as per the server's state information available to the arriving customers. First, we obtain the stability condition and stationary distribution of the system for those cases. Thereafter, we determine the customer equilibrium strategies, and some numerical illustrations are presented. [ABSTRACT FROM AUTHOR]

Queuing takes place when the number of individuals waiting in line surpasses the system's maximum capacity, occurring when the line extends beyond the available servers. The banking sector in Nigeria is facing challenges related to prolonged queues, adversely impacting the nation's economic growth. This issue results in customer dissatisfaction thereby hindering productivity and complicating patronage. Also, there is an economic loss to each person while remaining in the queue, which makes it essential to minimize, if not eliminate, the challenges of long queues in Nigerians banking system. This article assesses both single and multi-server exponential queuing models. Primary data was collected through direct observation and personal interviews, recording inter-arrival times and service durations from customer service unit of Access Bank Plc, Anyigba Kogi State. Performance indicators for both single and multi-server queuing models, such as utilization factor, average queue length, average system length, average queue waiting time, and average system waiting time, were computed and analyzed. The result revealed that the (M/M/S) :(FCFS/∞/∞) model outperforms the (M/M/1): (FCFS/∞/∞) model by minimizing customer waiting time from approximately 2.0 minutes to 0.03 minutes. This shows that introducing more servers reduces the workload per server, potentially attracting more customers. The analysis also indicates that for an optimal balance between service level and total cost, adopting the (M/M/4) :(FCFS/∞/∞) model is recommended, as it results in a lower cost of N 9,104.99 compared to N 10,793.43.

The automobile workshop queue system has been optimized using various approaches, such as queuing theory, simulation, and probability. The utilization of response surface methodology (RSM) for optimizing automobile workshop queue systems is not yet established. The utilization of RSM with direct observation enables the detection of patterns of correlations between variables and responses, which are then represented through mathematical equations. The optimization process involves numerous factors that impact queue performance, which can be categorized into two parts. The number of servers, number of phases, number of workers, worker experience, and layout are classified in inner design. This study examines the relationship between two components of the outer design, specifically the arrival rate and the interarrival time. The responses analyzed are queue cost, service time, average customer waiting time, and number of customers. The findings indicate that queue costs are not reliable for establishing the optimum value due to the significant impact of the cost structure on the structure of the optimal location. This study discovered that the number of leaving customers is related to queue costs and is relevant in selecting the optimal point. This study also formulates mathematical equations for predicting the optimal point. This study emphasizes the necessity for further investigation to uncover alternative mathematical equations that can precisely predict the optimal conditions for various types of services.

Due to unambiguous applications of bulk service vacation queues with set-up time in various fields such as pharmaceutical, aerospace engineering, automobile industries etc., in this article, we analyze an infinite-buffer batch-size-dependent bulk service queue with single and multiple vacations, N-policy and set-up time. Customers/packets/units are served by a single server according to general bulk service (a, b) rule. The service time of a batch dynamically varies with the batch-size and follows the general distribution which covers a large scale of distributions. Firstly, we generate the steady-state system equations. The main intend of this study is to obtain the complete joint distribution of queue-length and server content at service completion epoch, for which the bivariate probability generating function has been derived. We extract the joint distribution which is presented in a quite simple form and using those we find the joint distribution at arbitrary epoch beside some marginal distributions and performance measures. Finally, several numerical examples along with graphical sketches have been provided to verify the analytical results and to provide inner feeling to the system designers. [ABSTRACT FROM AUTHOR]

This study aims to develop web-based hospital management software. Several previous studies discovered some lack, such as manual queue calling, limited patient registration, difficult access to medical records, and the absence of reminders. In this study, we developed queue, reservation, medical record, reminder, and medical action modules. We expected that facilities could improve the operational efficiency of hospital services. The research stage starts with problem formulation, literature study, design determination, system development with five main modules, system testing, and the creation of research articles. Some limitations were identified, including responsive design and the expense of API system. [ABSTRACT FROM AUTHOR]

The paper explores the Kullback-Leibler divergence formalism (KLDF) applied to stable queue manifold. More potentially, both service time probability and cumulative functions, which make KLDF exact, are obtained. The credibility of KLDF is justified through consistency axioms. In other words, the current work provides a cutting-edge unification of information theory, combined with applied probability and divergence theory. Accordingly, this paper adds new knowledge, which extends a novel contemporary information theoretic link to some other different mathematical disciplines. The significance of Kullback-Leibler divergence (KLD) is highlighted through references to some potential applications of KLD to biometry. [ABSTRACT FROM AUTHOR]

The Petri Net (PN) model is a powerful mathematical representation for describing dynamic systems involving processes, states, and interactions between its elements. The use of the Petri Net Model has been applied in various contexts, in this research the Petri Net is used to represent the KKN (Real Work Lecture) application flow for students at the University of Lampung. This modeling provides a clear visual representation of the steps required, the stages that must be passed, and the relationships between elements in the KKN application process. This Petri Net Model analysis helps in identifying potential points that can cause delays or errors in the KKN application process. With a better understanding of inter-entity interactions and process flows, improvements and optimization of KKN application procedures can be implemented. The research results show that the use of the Petri Net Model in the context of KKN applications for Lampung University students has great potential to increase efficiency, reduce errors, and speed up the application process. [ABSTRACT FROM AUTHOR]

This paper analyzes the steady state behavior of batch arrival non-Markovian service queue with feedback, balking, reneging, and second optional service (SOS). The steady-state probabilities are computed using the probability generating function. After completing the first essential service (FES), if a customer is unsatisfied with it, he may choose to rejoin the system (feedback), opt for the SOS, or depart from the system with specific probabilities. Once a customer arrives, he decides immediately to join the queue or refuses to join (balking). Furthermore, after joining the queue if a customer does not get service within a specific time, may become impatient, and decide to leave the line without getting any service (reneging). Reneging time follows exponential distribution while service time (FES and SOS) follow general distribution. Also, the cost model was presented to determine the optimal service rates to minimize the expected cost. Finally, various performance measures and numerical illustrations are provided. [ABSTRACT FROM AUTHOR]

The article deals with the problem of traffic in three traffic-light intersections in the street network of Iasi city. Usually, the existing traffic lights do not fully take into account the size, structure and parameters of the queue of vehicles waiting at intersections; which in turn affects the traffic capacity of the intersection. In the study, we used a representative set of measurements taken at the three intersections to interpret the variation in the crossing speeds of the traffic light intersection space by the vehicle columns using the linear regression method. We studied several categories of vehicles queuing before the stop line at the intersection. We made a statistical analysis of the time taken to cross three intersections by vehicles in different starting positions. The main results of the research showed estimates in good agreement with observational data as well as a significant reduction in vehicle speed (to 58%) when there are different categories of vehicles queuing at the intersection. This study can be used in the urban traffic diagnosis method, being part of a traffic study together with urban traffic forecasting and therapy.

A wireless sensor system is an essential aspect in many fields. It consists of a great deal of sensor nodes. These sensor networks carry out a number of tasks, including interaction, distribution, recognition, and power supply. Data is transmitted from source to destination and plays an important role. Congestion may occur during data transmission from one node to another and also at cluster head locations. Congestion will arise as a result of either traffic division or resource allocation. Energy will be wasted due to traffic division congestion, which causes packet loss and retransmission of removed packets. As a result, it must be simplified; hence there are a few Wireless sensor networks with various protocols that will handle Congestion Control. The Deterministic Energy Efficient Clustering (DEC) protocol, which is fully based on residual energy and the token bucket method, is being investigated as a way to increase the energy efficiency. In the event of congestion, our proposal provides a way to cope with it and solves it using this method to improve lifespan of the sensor networks. Experiments in simulation show that the proposed strategy can significantly enhance lifetime, energy, throughput, and packet loss.

Non-preemptive priority queue system is a type of priority queue where customers with higher priorities cannot interrupt low priority one while being served. High priority consumers will still be at the head of the queue. This article discusses the non-preemptive priority queue system with multiple working vacations, where the vacation can be interrupted. Customers are classified into two classes, namely class I (non-preemptive priority customers) and class II, with exponentially distributed service rates. Customers will still receive services at a slower rate than during normal busy periods when they enter the system while it is on vacation. Suppose other customers are waiting in the queue after completing service on vacation. In that case, the vacation will be interrupted, and the service rate will switch to the busy period service rate. The model's performance measurements are obtained using the complementary variable method and analyzing the state change equation following the birth and death processes to find probability generating function for both classes. The results of the numerical solution show that the expected value number of customers and waiting time of customers in the queue for both class customers will be reduced when the vacation times rate (θ) and the vacation service rate (μ_0 ) increase.

A significant part of the movement of the population in large cities is carried out by bus transport. Higher accessibility and connection to the network of other types of public transport are the main features of bus transport. The need for mass passenger transportation in Baku mainly is met by the metro and bus transport. A small number of metro stations and insufficient coverage of the city territory by metro network have significantly increased the load on the bus service. With the increase in passenger traffic, the frequency of bus routes has increased, and the intervals have decreased. As a result, bus traffic on some streets has become more intense. This led to an increase in the number of buses arriving at the stops at the same time and the formation of queues in front of the stops. To solve the problem, the article proposes a method for coordinating bus schedules of different routes and adjusting the time of arrival at a stop without changing the intervals. As a result of applying the proposed methodology, by modelling the sequence of bus arrivals in the Anylogic program, a reduction in queues and loss of time in front of the bus stop is justified. Simulation testing was carried out for the scenario of bus movement both in the general flow and along the bus lane.

AbstractThis study aims to develop a queuing model at the Commercial Bank of Ethiopia to improve the service quality perceived by customers using a simulation tool. Performance variables that were considered when developing this model are the average waiting time for a client to get service, customer arrival rates, and service time. After the identification of the problem, the service quality of the bank is assessed using a questionnaire that was prepared in SERVQUAL format. The filled-out and returned questionnaires were analyzed using SPSS, and the results show that the service quality of the bank was deemed very low. The recorded data was then ultimately used as a basis for the determination of arrival, service rates, and the distribution function in the simulation input analyzer. The distribution function determined was used as an input for the development of the existing queue model, and based on that, scientific scenarios are adopted from scientific research and further observations at the bank are added to show enhancement of the existing model. The study used four scenarios to test the response group, and one scenario was selected as the best. This has been identified by adding a server to the counters where there is less utilization, that is, servers four and five. As a result, the waiting time has been minimized by 20 minutes under server four and by 83.4 minutes under server five. Also, the number of customers served per day can be increased from 1048 to 1168, which is 11.45% improvement.

The heterogeneous data traffic of today's network is a huge challenge to existing best-effort network technology, particularly in the context of large Ethernet, which handles hundreds to thousands of users. The existing conventional best-effort network technology is no longer efficient to handle the diversity of traffic types in the network and requires network management equipment such as Quality of Service (QOS). Usually, QOS is implemented on the gateway router. However, for better network performance and management, to guarantee high priority for sensitive traffic like video conferencing, Voice over Internet Protocol (VoIP), and streaming media within an internal network, it is nice to have QoS implemented on each router in the LAN network, starting from the access router to the gateway router. This paper is to demonstrate the effectiveness of the proposed dynamic QoS that has been developed and deployed in the LAN, purposely to provide adequate bandwidth for sensitive traffic when the network utilization is high and congested, by automatically modifying the QoS Queue's Maximum Bandwidth Rate-Limit of the best-effort traffic queue of the related router. The performance of the proposed developed dynamic QoS was evaluated via a comparison study before and after the dynamic QoS was presented in the network simulation environment that was built using Mininet. Results from the testing show that the developed dynamic QoS can improve the network's performance by automatically giving the appropriate bandwidth for sensitive traffic on the fly while needed/on demand. [ABSTRACT FROM AUTHOR]

In the present investigation, we consider a bulk queue model with the assumption that the server may stop working due to random failure during any stage of the service. As soon as the server fails, it is immediately sent for repair. The server offers all incoming units the first mandatory service and any one of the optional services as per the unit's requirements. For computation purposes, we assume that the server offers m+1 services, of which the first one is essential and the remaining are optional. The server may take a vacation in accordance with the Bernoulli vacation schedule with probability p as soon as both service phases of a unit are completed. As the system empties, the server idles and needs some time to set up before initiating the next service. In order to analyse the model and derive various steady-state queue length distributions, we incorporated the supplementary variables corresponding to service time, vacation time, and repair time and applied the probability generating function technique to determine the various system state distributions. Using these probability distributions, we derive the explicit form of various performance indices. To discuss the validity of the present model, we obtained some well-known results from the queueing literature as a special case of the present model by setting appropriate parameters. Finally, to analyse the sensitivity of several performance indices, a numerical demonstration is provided. [ABSTRACT FROM AUTHOR]

In this study, a queue management model/software was developed for automobile repair shops. This software minimizes both waiting time of customers, and idle time of workers. The software groups all jobs done in an automobile repair shop into three sections: mechanical, electrical and air conditioning (A/C) sections. The developed software prioritizes all jobs performed in a typical automobile repair shop in terms of urgency, using the 'shortest processing time' scheduling approach. The jobs are then ranked and assigned to workers based on number of available workstations. Also, expected time of delivery of the job is estimated by the software. The software was tested using data obtained over a two weeks period and percentage reduction in waiting time was found to range between: 0.889-0.122, 0.895-0.25 and 1-0.167 for the mechanical, electrical and A/C sections respectively. In the mechanical section, servicing/replacement of piston and rings and changing/servicing of gear box were discovered to be the jobs with maximum delivery time (15 hrs) while changing of engine belt was seen as the job with the least delivery time (0.3 hrs). For the electrical section, changing of alternator, with delivery time of 3 hrs 30 mins and changing of headlamp and fuse breakage with delivery time of 0.15 hrs are the jobs with maximum and minimum delivery times respectively. For the A/C section, changing of freezer with delivery time of 10 hrs and refilling of gas with delivery time of 0.10 hrs are the maximum and minimum respectively. Implementation of this research will reduce time wastage experienced by customers, idle time at service facilities, frustration caused by unnecessary queue, and encourage allocation of resources accordingly. [ABSTRACT FROM AUTHOR]

Along the duduksampeyan highway there is road construction (rigid pavement) so that the road section has narrowed, which originally had 4 two-way lanes reduced to 2 two-way lanes along 1.5 km so that traffic became paralyzed and caused long queues of vehicles. This results in a significant delay that can harm transportation users who cross the road. The purpose of this study was to determine the length of queues and travel delay times. Then the data that has been obtained from the field is then analyzed based on technical aspects based on the Indonesian road capacity guidelines in 2014 (PKJI, 2014). From the analysis of the queue length above, the longest queue with a length of 2481.3 meters from the direction of Lamongan - Surabaya and the shortest queue with a length of 1187.1 meters in the direction of Lamongan - Surabaya. The results of the delay time analysis found that the highest delay time occurred on Monday at 07:00 – 08:00 with a delay time of 26,26 minutes from the direction of Lamongan - Surabaya and on Wednesday at 08:00 – 09:00 was the lowest delay time with a delay time of 0,1 minutes from the direction of Lamongan - Surabaya.

Queues have been at the centre of South Africa's COVID-19 story. National lockdown was declared on 26 March 2020, around the time 'month-end' salaries and government grants are paid out. Within the first few days, reports came of the long lines outside banks and supermarkets, with journalists regularly citing people's failure to 'social distance'. This article uses the queue as an analytic tool to explore the unequal vulnerabilities entailed in the experience of COVID-19 lockdown in South Africa. [ABSTRACT FROM AUTHOR]

At the starting point of this case study, a garrison hospital performed an assessment of the need for treatment when the number of conscripts queuing at reception is at its highest level. The research aims to find out the reasons for conscripts' perceived long waiting times, which causes absence from the conscripts' training. According to the predictions made by the queuing simulation, the hospital's staff are able to receive patients arriving at reception in the morning without the queue time causing undue harm to training. However, during large congestion peaks, the waiting times may become unreasonable, which would require an increase in human resources. Peaks of congestion usually occur at the beginning of the week, as well as on days with heavy military training. [ABSTRACT FROM AUTHOR]

Direct vehicle access at site is usually restricted in situations where the driveway corner clearance (DCC) is designated, as per the District Unit Planning Guidelines. Currently, no clear installation standard for the DCC in Korea exists; thus, vehicles are allowed access regardless of the clearance between the driveway and the intersection. When driveways are located adjacent to the intersection, frequent conflicts between vehicles on minor and major roads occur. This results in problems with traffic communication and safety, necessitating a reasonable design. Therefore, in this study, DCCs were classified into upstream driveway corner clearance (UDCC) and downstream driveway corner clearance (DDCC), and algorithms and scenarios for calculating the appropriate DCC distance were proposed. DDCC was calculated from the traffic volume entering the rightmost lane of the DDCC from among the 12 intersection directions by applying optimized signal phase sequence and car-following theory. The DDCC results demonstrated that at least one vehicle in the driveway can exit to the rightmost lane on the roadway at 9.22 m. Two vehicles can exit at 32.15 m, and three vehicles can exit at 67.54 m. UDCC was calculated by considering its geometry, the traffic volume, queue length, and the 8.45 m additional distance from the driveway. Therefore, as traffic volume increased, the queue length and queue clearance time of the queue increased. The calculated DCC distance proposed in this study can contribute to establishing design standards in the future when establishing guidelines for district unit planning. [ABSTRACT FROM AUTHOR]

Fifth generation (5G) technology aims to provide superior services, such as high data rates, reduced delays, increased capacity, and a shift away from service orientation to user guidance, innovations, and new needs. Users require an efficient resource of management and allocation. Software-defined networking-based 5G is a shared research for resource allocation and connectivity to the 5G network. This paper introduces an algorithm, queue management with ingress policing (QMIP), to improve the quality of service for software-defined networking-based 5G. The objective of the algorithm is to manage the queue for traffic requests with ingress policing. The algorithm allows queue allocation according to the characteristics of the incoming traffic and creates a policy that specifies a fixed amount of bandwidth for the specified traffic or host that will use the network resources. In this study, the proposed algorithm is compared with other similar techniques to study its effectiveness. A simulation and analysis were conducted on a Floodlight controller and Mininet to test the performance of QMIP and compare it with other queueing algorithms. The results show that QMIP outperforms the other algorithms. [ABSTRACT FROM AUTHOR]

This study aims to develop a queuing model at the Commercial Bank of Ethiopia to improve the service quality perceived by customers using a simulation tool. Performance variables that were considered when developing this model are the average waiting time for a client to get service, customer arrival rates, and service time. After the identification of the problem, the service quality of the bank is assessed using a questionnaire that was prepared in SERVQUAL format. The filled-out and returned questionnaires were analyzed using SPSS, and the results show that the service quality of the bank was deemed very low. The recorded data was then ultimately used as a basis for the determination of arrival, service rates, and the distribution function in the simulation input analyzer. The distribution function determined was used as an input for the development of the existing queue model, and based on that, scientific scenarios are adopted from scientific research and further observations at the bank are added to show enhancement of the existing model. The study used four scenarios to test the response group, and one scenario was selected as the best. This has been identified by adding a server to the counters where there is less utilization, that is, servers four and five. As a result, the waiting time has been minimized by 20 minutes under server four and by 83.4 minutes under server five. Also, the number of customers served per day can be increased from 1048 to 1168, which is 11.45% improvement. [ABSTRACT FROM AUTHOR]

In several manufacturing systems, server's breakdown is a common phenomenon for which renovation of the service station is required and has a definite effect on the system. The server's vacation is a significant tool to deal with the systems where a common server is shared by several users. The principal goal of this paper is to analyze a batch-service queueing model with server's breakdown, multiple vacations and batch-size-dependent service time. To be more precise, the center of attention is on the queue length together with server content distribution for which we obtain the bivariate probability generating function using supplementary variable technique. Server content distribution is very worthy for the manufacturing systems. The probabilities have been extracted and used to acquire the arbitrary epoch probabilities. In order to upgrade the qualitative aspects of the concerned model, diverse numerical results and graphical observations are illustrated. [ABSTRACT FROM AUTHOR]

Queuing is a phenomenon that we can encounter anywhere and anytime, such as queuing to get food orders, ticketing services, and so on. However, unfortunately not everyone likes to queue, especially queuing for public agency services. This is because of various kinds, such as irregular queues, the number of people queuing so that it makes people lazy to queue, or even because there is a sudden need so they cannot queue for long. Especially during the Covid-19 pandemic, people avoid physical contact between each other, so to overcome this, an organized queue number system is needed and can be ordered online through an application on a smartphone. Customers can order a queue number and monitor the queue number being served through an application on a smartphone, there is also a call to each queue number to be served. This research also applies the internet of things (IoT) system which is used to display the queue number served on a P10 LED Display.

Retail customers often wait to complete their purchases during the checkout process. Prior research suggests that long checkout lines and service delays negatively affect customers’ evaluation of store services. The present study investigates the potential customer and in-store distractions and their implication for emotional discomfort due to crowding stress. This study employed a cross-sectional research design and surveyed 385 respondents visiting the target retail outlets in Bengaluru, India. Correlation analysis explored the relationship between self-distraction, in-store distractions, and emotional discomfort. The study found that self-distraction negatively correlates with discomfort while in the queue (r = –0.119) and discomfort during the billing (r = –0.119). In contrast, in-store distractions (r = –0.161) and video displays near the checkout area (r = 0.116) effectively reduce emotional discomfort while in the queue. Additionally, point-of-purchase (POP) display (r = –0.265) and availability of refreshments near the billing counter (r = –0.175) are effective in reducing emotional discomfort during the billing. This study thus offers viable and affordable methods of improving the customer’s waiting experience while contributing to store profits.

The article presents an ethnography of the queue that formed in the Comic Con Experience parking lot on December 6, 2019 to access the Cinemark auditorium panels, held the next day. Based on the article by Leon Mann called Queue Culture: The Waiting Line as a Social System (1969) and on the book Fila e Democracia (2017) by Roberto DaMatta and Alberto Junqueira, this text defines the queue as a space democratic public. The study also understands that it consists of a social practice that generates sociabilities, marked by a sense of community. The article concludes that references to pop culture narratives present in the event and in the queue generate an affective anteriority that, shared between individuals, establishes a "common" that links their behaviors, emotions and affections, as discussed by Muniz Sodré in the book The science of the common: notes on the communicational method (2014). [ABSTRACT FROM AUTHOR]

In this paper, we develop a new class of Markov model with working disasters, second optional service, and reneging of customers. The disasters can occur during regular busy period. Whenever a disaster occurs, server continues to serve the customers with a lower service rate instead of completely stopping the service and after the completion of disaster recovery it switches to the regular busy period. Steady-state solution of the model is obtained by using probability generating function technique and stability condition is derived. Further, some important performance measures are presented. A cost model is developed in order to obtain the optimal service rates during first essential service, second optional service and during disaster period using quadratic fit search method. At the end, we provide some numerical examples to visualize the applicability of the model in practical situations. [ABSTRACT FROM AUTHOR]

This article presents a simulation model of the effect of the COVID-19 Biosafety protocol in the Queues for the return to face-to-face classes as a basis for the return of educational activities. The restrictive measures to face the COVID-19 pandemic, greatly affected the normality of the development of activities carried out in higher education, constituting a great challenge since the measures and conditions of return and access to institutions are different from what was previously carried out before the pandemic. The objective of this article is to carry out a simulation of queues through SIMIO (Logistics process simulation software), where the number of students expected per day and the average entry times are taken into account to adjust them to an exponential distribution, from this information loaded into the simulation it is They will determine if the times increase or decrease taking into account the theory of queues and conditions presented in the study such as the probability distribution of the times of each of the processes involved in the process of accessing the University facilities. [ABSTRACT FROM AUTHOR]

Multiple core processors have already became the dominant design for general purpose CPUs. Incarnations of this technology are present in solutions dedicated to such areas like computer graphics, signal processing and also computer networking. Since the key functionality of network core components is fast package servicing, multicore technology, due to multi tasking ability, seems useful to support packet processing. Dedicated network processors characterize very good performance but at the same time high cost. General purpose CPUs achieve incredible performance, thanks to task distribution along several available cores and relatively low cost. The idea, analyzed in this paper, is to use general purpose CPU to provide network core functionality. For this purpose parameterized system model has been created, which represents general core networking needs. This model analyze system parameters influence on system performance.

As part of a research, the study of the level of solving the scientific problem of transport flow management in large cities was carried out as a component of the integrated information-intelligent transport system of the city. A significant amount of research on a number of important components of the problem has been identified, including the application of new approaches, methods and information technologies for planning and forecasting traffic flows, optimization of bimodal urban networks. The software implementation of a mathematical model to optimize the interaction of urban passenger transport, passenger transfer points and urban trains in major transportation hubs in terms of sustainable development and digitalization was proposed. A toolkit for the integrated interaction of city train, urban passenger transport and passenger transfer points in major cities has been implemented. As a result of the study, a high level of versatility of the proposed model and the possibility of its active practical application was determined.

Mobile network processing and the Edge Computing paradigm can be integrated as a unit called mobile fog computing in fifth-generation networks. Because mobile devices have less computing capacity such as limited CPU power, storage capacity, memory constraints, and limited battery life, therefore, computationally intensive tasks migrate from MDs to MFC. In this paper, we formulate an optimization scheme based on the Greedy Knapsack Offloading Algorithm (GKOA) to minimize the energy consumption of the MDs and save the capacity of limited resources. For resource allocation and dynamic scheduling, we present a dynamic scheduling algorithm based on the priority queue. We design two queues where the tasks with high execution times have the high priority in high time queue and the other, tasks with low execution times have the high priority in low time queue. These two priority queues work together and call as High Low Priority Scheduling (HLPS) model. Numerical results demonstrate the GKOA scheme improves energy efficiency by 19 % , system overhead by 13.87 % , and average delay by 8.5 % on the MD side than local computing. Also, our proposed scheduling algorithm performs optimal results than several benchmark algorithms in terms of waiting time, delay, service level, average response time and the number of scheduled tasks on the MFC side. [ABSTRACT FROM AUTHOR]

The paper deals with an M/M/2 Queueing Model with working vacations and reneging of customers due to impatience. The matrix geometric method is used to find the distribution of the number of customers in the system. A cost function is constructed to obtain the optimal value of the service rate to optimize (minimize) the cost function using the Quadratic Fit Search Method (QFSM). Further, the effects on the system's performance measures using numerical analysis and graphical representation are studied. [ABSTRACT FROM AUTHOR]

Problem and goal. The article deals with the problem of improving the preparation of students for computer science Olympiads with the help of a specialized electronic educational resource (EER). Methodology. The research uses the analysis of existing EER to prepare for computer science Olympiads. Results. The assumption is put forward about the need to create a specialized EER for preparing students for computer science Olympiads, the requirements for it are formulated, interface and the operating procedure of EER are described. Conclusion. The use of the EER considered in the article makes it possible to increase the effectiveness of preparing students for participation in computer science Olympiads.

The autonomous mobility-on-demand (AMoD) system is regarded as a promising shared mobility method for the sustainable transportation system. In addition, battery swapping could become an efficient energy-refueling means for electric vehicles (EVs). The quality-of-service aware battery swapping price determined by the battery swapping stations (BSSs) considers the interaction between AMoD fleet and BSSs, which is formulated as a bilevel optimization problem in this article. The interdependence between two systems is bridged by the swapping price that is both time-varying and location-varying. In the upper level, the swapping pricing is optimized to reflect the battery inventory so that the EV fleet could be navigated for the BSS strategically, the queue time would be reduced consequently. BSS operator optimizes swapping pricing scheme and battery charging management with the objective of minimizing the cost induced by the queue process and battery charging. In the lower level, a unified network flow model incorporating queue procedure in BSSs is proposed in order to characterize the operational decision of AMoD fleet. The AMoD operator develops fleet scheduling strategies with the objective of maximizing the AMoD system profit. An iteration-based algorithm is applied to attain the results and the effectiveness of the algorithm is validated by the real-world data from New York. [ABSTRACT FROM AUTHOR]