Optimizing Queueing Systems with N-Policy through Vedic Mathematical Techniques

Abstract

Queuing theory is important for improving system performance in many fields, such as manufacturing, healthcare, and telecoms. But standard models are hard to compute, especially when dealing with very big systems. Using Queueing Theory, N-policy, and Vedic mathematics together in this paper is a new way of doing things. By starting service only when the number of entities hits a certain level, the N-policy approach makes better use of resources and cuts down on system idle times. With its efficient number theory, Vedic Mathematics makes complicated calculations easier. This makes the study of queueing models faster and less computer-intensive.

By combining these methods, this paper shows how Vedic techniques make it easier to figure out data related to queues, like waiting times and system usage. The research looks at how the findings could be used in real life, looking at examples such as information networks, managing healthcare services, and manufacturing processes. This mix of different fields not only creates a new way to improve queueing systems, but it also shows how Indian Knowledge Systems can be used to solve modern math problems. Ultimately, this method gives us new ideas for how to make systems work better and use resources more wisely.