پیوندهای مفید
آمار
| تعداد نشریات | 31 |
| تعداد شماره‌ها | 743 |
| تعداد مقالات | 7,049 |
| تعداد مشاهده مقاله | 10,173,769 |
| تعداد دریافت فایل اصل مقاله | 6,847,233 |
A maximum entropy approach for the N policy M/G/1 queueing system with a removable server | ||
| Computational Sciences and Engineering | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 13 خرداد 1403 | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22124/cse.2024.27465.1079 | ||
| نویسندگان | ||
| Moein Mohsenzadeh* 1؛ Abdolrahim Badamchizadeh2؛ Mohammad Jelodari Mamaghani3 | ||
| 1Department of Statistics, Allameh Tabataba’i University, Tehran, Iran. | ||
| 2Department of Statistics, Allameh Tabataba’i University, Tehran, Iran. | ||
| 3Department of Mathematics, Allameh Tabataba'i University, Tehran, Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژه‌ها | ||
| Maximum entropy؛ M/G/1 queueing system؛ N policy؛ removable server | ||
|
آمار تعداد مشاهده مقاله: 102 |
||