Maximum Entropy Solution for M^X/G/1 Priority Reiterate G-queue Under Working Breakdown and Working Vacation

The maximum entropy principle has grown progressively more pertinent to queueing systems. The principle of maximum entropy (PME) presents an impartial framework as a promising method to examine complex queuing processes. This principle can be employed to assess the most appropriate probability distributions for queueing scenarios in a variety of widespread industrial issues. The aspects of general service bulk arrival retrial G-queue including working vacation, state-dependent arrival, priority users, and working breakdown are all explored in this article. Real-world applications for this kind of waiting line include computer systems, industrial companies, packet-switching networks, and communication facilities, etc. The adverse users (or negative arrivals) can make an appearance when the server (operator) is preoccupied with a positive user. Consumer’s arrival patterns follow the Poisson distribution. Priority consumers and regular (ordinary) consumers are the two groups of consumers that are considered in this investigation. Priority consumers do not have to wait in line and are granted a special right of prevention that allows them to receive services before ordinary consumers. Initially, we have estimated performance metrics including orbit size and long-run probabilities in this research work. The maximum entropy approach is then used to give a comparative perusal between the system’s exact and estimated waiting times. Apart from that a bi-objective optimization model is developed to diminish both consumers waiting times and estimated costs simultaneously. It is manageable to establish an effective balance between the standard of service and operating expenses using the analytical strategy that has been provided.