Search

The transient and metaheuristic cost analysis of a MX/G(a, b)/1 retrial queue with random failure during an extended Bernoulli vacation with impatient clients is covered in this study. Any batch that arrives and discovers the server is busy, down, or on vacation joins an orbit. In the alternative, only one new customer from the group joins the service right away, while the others join the orbit. After providing each service, the server either waits to serve the following customer with probability (1 - θ) or goes on vacation with probability θ. It has been found that these systems express steady-state solutions and are dependent on time probability generating functions in consideration of their Laplace transforms. We also discuss a few exceptional and particular instances. After that, the impact of different parameters on the system's effectiveness is evaluated. We are also talking about ANFIS. Additional approaches employed in this study to swiftly determine the system's optimum cost include genetic algorithms (GA), artificial bee colonies (ABC), and particle swarm optimization (PSO). We also examined the graph-based convergence of several optimization algorithms. [ABSTRACT FROM AUTHOR]

In 2002, the Working Vacation (WV) queues were implemented as an extension of standard queueing models with vacations. During the vacation period in WV queues, the server provides service at a slower pace as opposed to the typical busy period. The objective of this survey is to provide a concise overview of the latest scholarly investigations on queueing models for WVs. The concept of a queue with WV has been implemented across various domains, encompassing computer systems, communication networks, production management, computer communication, manufacturing, and inventory systems. Additionally, it has been applied to network service, web service, file transfer service, and mail service. [ABSTRACT FROM AUTHOR]

In this paper, a quantitative research survey is carried out on discrete-time queueing models. In real-life scenarios, the idea of discrete-time queues has taken on a new meaning. This survey mainly focuses on the unfolding of discrete-time queueing models in recent decades, challenges implied on them and their influence in various fields. The ultimate goal of this paper is to provide enough information to all the researchers and analysts who toil in this field and wish to know more about these models. A few open issues and intriguing future research paths has been discussed. [ABSTRACT FROM AUTHOR]

This research article examines an M/M/2 heterogeneous queueing model that provides two services: a mandatory first essential service (FES) and an optional second optional service (SOS). The model incorporates breakdown, feedback, and a hybrid vacation policy. Matrix expressions are structured to evaluate the stationary probability distribution of the number of customers in the system and system performance measures using the matrix-geometric approach (MGA). Additionally, formulas are being developed to estimate the model's performance indicators. The cost function is being evaluated to determine the best values of the system's decision variables, and an adaptive neural fuzzy inference system (ANFIS) based on soft computing technology is being utilized to validate the obtained results. [ABSTRACT FROM AUTHOR]