Document Type : Original Article

Authors

• Moein Mohsenzadeh ¹
• Abdolrahim Badamchizadeh ²
• Mohammad Jelodari Mamaghani ³

¹ Department of Statistics, Allameh Tabataba’i University, Tehran, Iran.

² Department of Statistics, Allameh Tabataba’i University, Tehran, Iran.

³ Department of Mathematics, Allameh Tabataba'i University, Tehran, Iran

Abstract

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.

Keywords

• Maximum entropy
• M/G/1 queueing system
• N policy
• removable server