| 具有可利用服务员的M/G/1排队模型 |
| |
| 引用本文： | 李晋枝.具有可利用服务员的M/G/1排队模型[J].运筹学学报,2006,10(1):47-54. |
| |
| 作者姓名： | 李晋枝 |
| |
| 作者单位： | 南开大学数学学院,天津,300071 |
| |
| 基金项目： | Supported by the Natural Science Foundation of China (Grant No. 10131040). |
| |
| 摘 要： | 本文考虑了具有可利用服务员的M／G／1有有限容量的排队模型．当工作量超过k(k是常数或者随机变量),可利用服务员参与工作,一直到工作量少于或等于k．可利用服务员的速率依赖于目前工作量．应用Level-crossing方法,获得了工作量的平稳分布．应用Kolmogorov向后微分方程方法,构造更新方程以获得忙期的Laplace变换．
|
| 关 键 词： | 运筹学 M／G／1排队模型 可利用服务员 工作量 忙期 |
| 收稿时间： | 2005-03-07 |
| 修稿时间： | 2005年3月7日 |
M/G/1 Queue with an Available Server |
| |
| Li Jinzhi.M/G/1 Queue with an Available Server[J].OR Transactions,2006,10(1):47-54. |
| |
| Authors: | Li Jinzhi |
| |
| Institution: | School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, China |
| |
| Abstract: | We consider M/G/1 queue with an available server, which is infinite capacity with Poisson arrivals. When the workload exceeds k (k > 0 is a constant or a random variable), an available server attends and works with initial server until the workload is less than or equal to k. The available server's rate depends on the workload present. Applying the level-crossing argument, we show the steady-state distribution of the workload. Also using the Kolmogorov's backward differential equation, we construct renewal equations to get the Laplace transform of the busy period. |
| |
| Keywords: | Operation research M/G/1 queue available server workload busy period |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
