服务行业排队论问题分析

本文运用排队论理论对服务行业的排队现象进行了分析,较好的解决了问题。面对加入WTO,企业应把提高顾客满意度放在首位,以获得长期竞争优势。     

一种基于闭排队网络的集装箱码头设备配置优化模型

将集装箱码头龙门吊装卸工艺抽象为闭排队网络模型,采用估算均值法计算了顾客到达和服务时间分布为一般情况的闭排队网络系统性能指标.仿真结果表明,闭排队网络模型计算结果可以为集装箱码头设备配置提供一定的决策支持.     

Transient detailed balance and product form for reaction networks

This paper explores the boundary of the set of reaction networks that have an exact transient (truncated) multidimensional Poisson or product-form distribution for the number of particles of different types. Motivated by the birth–death process, we introduce the notions of transient detailed balance and delay functions, and use these notions to obtain the novel transient product-form distribution in a coagulation-fragmentation process for polymers with a tree-like structure from that of the pure coagulation process.     

Limit Theorems for Semi-Markov Queues and Their Applications

We begin by definition of semi-Markov flow and discussion of its properties. Asymptotic behavior of multi-server and single-server queueing systems is studied under assumption of time-compression or service time growth. The results obtained are used for calculation of large systems reliability. Statistical estimates of parameters involved are also provided.     

Competition and The Operational Performance of Hospitals: The Role of Hospital Objectives

We examine the effect of a hospital's objective (i.e., non‐profit vs. for‐profit) in hospital markets for elective care. Using game‐theoretic analysis and queueing models to capture the operational performance of hospitals, we compare the equilibrium behavior of three market settings in terms of such criteria as waiting times and patient costs from waiting and hospital payments. In the first setting, a monopoly, patients are served exclusively by a single non‐profit hospital; in the second, a homogeneous duopoly, patients are served by two competing non‐profit hospitals. In our third setting, a heterogeneous duopoly, the market is served by one non‐profit hospital and one for‐profit hospital. A non‐profit hospital provides free care to patients, although they may have to wait; for‐profit hospitals charge a fee to provide care with minimal waiting. A comparison between the monopolistic and each of the duopolistic settings reveals that the introduction of competition can hamper a hospital's ability to attain economies of scale and can also increase waiting times. Moreover, the presence of a for‐profit sector may be desirable only when the hospital market is sufficiently competitive. A comparison across the duopolistic settings indicates that the choice between homogeneous and heterogeneous competition depends on the patients' willingness to wait before receiving care and the reimbursement level of the non‐profit sector. When the public funder is not financially constrained, the presence of a for‐profit sector may allow the funder to lower both the financial costs of providing coverage and the total costs to patients. Finally, our analysis suggests that the public funder should exercise caution when using policy tools that support the for‐profit sector—for example, patient subsidies—because such tools may increase patient costs in the long run; it might be preferable to raise the non‐profit sector's level of reimbursement.     

GI／G／1可修排队系统的注记

在文献［１］的基础上，进一步分析了在服务台可修的ＧＩ／Ｇ／１排队系统中服务台的如下可靠性问题：１）在忙期内的失效次数；２）在时间（０，ｔ］内的平均失效次数的近似计算；３）在忙期内的失效时间和工作时间；４）在时间（０，ｔ］内平均失效时间的近似计算，并且得到一些新的可靠性参数的计算结果。     

服务台需要检修的M／PH／1排队模型分析

本文研究了一个M／PH／1排队,这个排队系统的服务台每服务完一定量的顾客，就要进行一闪检修，然后才继续服务。在检修时间服从位相（PH）分布时，本文求出了这个系统达到平衡的条件以及有关排队率和可靠性的指标。顺便求出了普通的M／PH／1系统第M个顾客离去时刻的分布。     

On Block Skip Free Transition Matrices and First Passage Times

Starting from an abstract setting which extends the property “skip free to the left” for transition matrices to a partition of the state space, we develop bounds for the mean hitting time of a Markov chain to an arbitrary subset from an arbitrary initial law. We apply our theory to the embedded Markov chains associated with the M/G/1 and the GI/M/1 queueing systems. We also illustrate its applicability with an asymptotic analysis of a non-reversible Markovian star queueing network with losses.     

Matrix-analytic Models and their Analysis

We survey phase-type distributions and Markovian point processes, aspects of how to use such models in applied probability calculations and how to fit them to observed data. A phase-type distribution is defined as the time to absorption in a finite continuous time Markov process with one absorbing state. This class of distributions is dense and contains many standard examples like all combinations of exponential in series/parallel. A Markovian point process is governed by a finite continuous time Markov process (typically ergodic), such that points are generated at a Poisson intensity depending on the underlying state and at transitions; a main special case is a Markov-modulated Poisson process. In both cases, the analytic formulas typically contain matrix-exponentials, and the matrix formalism carried over when the models are used in applied probability calculations as in problems in renewal theory, random walks and queueing. The statistical analysis is typically based upon the EM algorithm, viewing the whole sample path of the background Markov process as the latent variable.     

Explicit Formulae for the Queue Length Distribution of Batch Arrival Systems

Abstract

A G ^θ I/G/1-type batch arrival system is considered. Explicit formulae for the distribution of queue length both at the fixed time t and as t → ∞ are obtained. The study is based on the generalization of Korolyuk's method for semi-markov random walks.