
تعداد نشریات | 31 |
تعداد شمارهها | 804 |
تعداد مقالات | 7,707 |
تعداد مشاهده مقاله | 35,374,839 |
تعداد دریافت فایل اصل مقاله | 7,820,870 |
analysis of a M[X]/G/1 queueing system with an unreliable server and delaying vacations using maximum entropy | ||
Computational Sciences and Engineering | ||
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 22 مرداد 1404 | ||
نوع مقاله: Original Article | ||
شناسه دیجیتال (DOI): 10.22124/cse.2025.30255.1101 | ||
نویسندگان | ||
moein mohsenzadeh* 1؛ Mahdi Doustparast2؛ Abdolrahim Badamchizadeh3؛ mohammad Jelodari Mamaghani4 | ||
1Ph.D. student of Statistics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, Mashhad, Iran | ||
2Department of Statistics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, Mashhad, Iran | ||
3Department of Statistics, Allameh Tabataba’i University, Tehran, Iran. | ||
4Department of Mathematics, Allameh Tabataba'i University, Tehran, Iran | ||
چکیده | ||
This paper deals with a single unreliable server and with delaying vacations which has Poisson arrivals and general distribution for the service times. The server can be activated at arrival epochs or deactivated at service completion epochs. The maximum entropy principle is increasingly relevant to queueing systems. The principle of maximum entropy (PME) presents an impartial framework as a promising method to examine complex queuing processes. 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^([X])/G/1 queueing system؛ delaying vacations؛ un-reliable server | ||
آمار تعداد مشاهده مقاله: 3 |