Please use this identifier to cite or link to this item:
標題: Maximum entropy analysis to the N policy M/G/1 queueing system with server breakdowns and general startup times
作者: Wang, K.H.
Wang, T.Y.
Pearn, W.L.
關鍵字: control;Lagrange's method;maximum entropy;M/G/1 queue;startup;unreliable server;non-reliable server;removable service station;input queue;infinite
Project: Applied Mathematics and Computation
期刊/報告no:: Applied Mathematics and Computation, Volume 165, Issue 1, Page(s) 45-61.
We study a single removable and unreliable server in the N policy M/G/1 queueing system with general startup times where arrivals form a Poisson process and service times are generally distributed. When N customers are accumulated in the system, the server is immediately turned on but is temporarily unavailable to the waiting customers. He needs a startup time before providing service until the system becomes empty. The server is subject to breakdowns according to a Poisson process and his repair time obeys an arbitrary distribution. We use maximum entropy principle to derive the approximate formulas for the steady-state probability distributions of the queue length. We perform a comparative analysis between the approximate results with established exact results for various distributions, such as exponential (M), fc-stage Erlang (E-k), and deterministic (D). We demonstrate that the maximum entropy approach is accurate enough for practical purposes and is a useful method for solving complex queueing systems. (c) 2004 Published by Elsevier Inc.
ISSN: 0096-3003
DOI: 10.1016/j.amc.2004.04.115
Appears in Collections:應用數學系所

Show full item record

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.