具有负顾客到达的M／G／1可修排队系统(英文)  

On the M/G/1 G-queues with Unreliable Server

作　　者：周文慧[1] 邓永录[2] 

机构地区：[1]华南理工大学工商管理学院,广州510640 [2]中山大学统计科学系,广州510275

出　　处：《运筹学学报》2006年第2期28-36,共9页Operations Research Transactions

基　　金：The research was supported by the National Natural Science Foundation of China with Grant 10501014.

摘　　要：本文考虑一个具有负顾客到达的M／G／1可修捧队系统．所有顾客(包括正顾客和负顾客)的到达都是泊松过程,服务器是可修的．Harrison和Pitel研究过具有负顾客到达的M／G／1捧队系统．这里我们推广到有可修服务器情形,系统的稳态解最后可以通过Fredholm积分方程解出．The paper concerns an M/G/1 G-queues with removable server. Arrivals of customers （both positive customers and negative customers） are a Poisson process and the server may break down with Poisson rate and need repair time. Harrison and Pitel （1996） investigated a M/G/1 queue with negative arrivals. In this paper, we extend the analysis to a G-queue with removable server. We show the equilibrium results of this system can still be reduced to Fredholm integral equations that can be solved numerically.

关 键 词：运筹学 负顾客 可修排队系统 FREDHOLM积分方程 

分 类 号：O226[理学—运筹学与控制论] O211.6[理学—数学]