服务台可修的排队系统最优更换模型  

Optimal Replacement Model for M/G/1 Queuing System with Repairable Service Station

作　　者：贾积身[1] 任仲普[2] 

机构地区：[1]河南机电高等专科学校基础部,河南新乡453002 [2]安阳师范学院,河南安阳455000

出　　处：《安阳师范学院学报》2002年第5期8-9,51,共3页Journal of Anyang Normal University

基　　金：河南省自然科学基金第 0 1110 42 2 0 0号

摘　　要：研究了服务台可修排队系统的最优更换策略 ,假定服务台不能“修复如新” ,利用几何过程 ,以被服务的顾客数N为其更换策略 ,选择最优的N ,使得系统长期运行单位时间内的期望效益达到最大 ,并求出了系统经长期运行单位时间内期望效益的明显表达式 ,最后还对结果进行了讨论。This paper consider the optimal replacement policy for the queuing system with repairable service station.Assume that the service station after repair is not 'as good as new',by using geometric process,we take the number N of the customer that have been serviced at the service station as its replacement model.The problem is to determine the optimal replacement policy N such that the long-run expected benefit per unit time is maximum.The explicit expressions of the long-run expected benefit per unit time is derived,Finally,we discuss the result also.

关 键 词：服务台可修 排队系统 最优更换模型 更换策略 几何过程 期望效益 排队论 

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