University of Guilan Computational Sciences and Engineering 2783-2503 3 2 2024 06 02 A maximum entropy approach for the N policy M/G/1 queueing system with a removable server 219 229 7780 10.22124/cse.2024.27465.1079 EN Moein Mohsenzadeh Department of Statistics, Allameh Tabataba’i University, Tehran, Iran. Abdolrahim Badamchizadeh Department of Statistics, Allameh Tabataba’i University, Tehran, Iran. Mohammad Jelodari Mamaghani Department of Mathematics, Allameh Tabataba'i University, Tehran, Iran Journal Article 2024 05 13 The maximum entropy principle has grown progressively more pertinent to queueing systems. The principle of maximum entropy presents an impartial framework as a promising method to examine complex queuing processes. In this research, the N policy M/G/1 queueing system with a removable server was analyzed by using the maximum entropy method. We use maximum entropy principle to derive the approximate formulas for the steady-state probability distributions of the queue length. The maximum entropy approach is then used to give a comparative perusal between the system’s exact and estimated waiting times. We demonstrate that the maximum entropy approach is efficient enough for practical purpose and is a feasible method for approximating the solution of complex queueing systems. https://cse.guilan.ac.ir/article_7780_cf801531adfd085623d27e7305fe93f1.pdf