变参数随机服务系统最优设计

利用排队理论，建立了一个到达率递增、服务率不变、服务台数量递减的变参数随机服务系统最优设计模型。给出了满足投资有限，在一定时期内设备使用率和用户服务质量满足给定的要求，使用寿命达到设计的服务系统最优设计方案。     

无穷服务台多级服务系统

本文讨论了成批输入的多级服务系统M~([X])/G_1,G_2,…,G_N/∞,此系统有无穷多个服务台,每个服务台都分为N级,顾客进入服务台后顺次接受各级服务,直到完成所有N级服务后才离开系统,在此顾客离开系统之前,该服务台不再接纳其它顾客.文中给出了任意时刻t正进行各级服务的服务台台数的联合分布的母函数,以及其平稳分布的母函数,还研究了该系统的输出过程和忙期.     

离散时间服务台可修的排队系统MAP／PH（PH／PH）／1

本文研究离散时间可修排队系统,其中顾客的输入过程为离散马尔可夫到达过程（MAP）,服务台的寿命,服务台的顾客的服务时间和修理时间均为离散位相型（PH）变量,首先我们考虑广义服务过程,证明它是离散MAP,然后运用阵阵几何解理论,我们给出了系统的稳态队长分布和稳态等待时间分布,同时给出了系统的稳态可用度这一可靠性指标。     

有一般服务运作和休假时间的排队系统

考虑一个有一般服务运作和休假时间的M／M／1排队系统。这时服务是非空竭的,也就是说服务员可能在系统有顾客的情形下进入休假,服务员的运作时间和休假时间都为一般分布,且相互独立,使用补充变量的方法,求解出系统稳态队长的母函数,在求解过程中遇到的未知函数po(x),可利用第一类Fredholm积分方程的数值解来确定,最后给出了系统稳态平均队长。     

串联在可修服务台损失制排队系统分析

本文分析了一咱新的可修排队系统，该系统有两个可修单元组成，在服务时间内，顾客无须等待且很快离开，我们称这种情况为损失顾客，利用向量马尔科夫过程方法，我们获得一系列可靠性指桔，以及其他一些结果。     

两个不同服务台的可修排队系统的矩阵几何解

本文研究了具有不同服务率的两服务台排队系统,其中服务台1完全可靠,服务台2可能发生故障.通过拟生灭过程的方法求出了.系统稳态平衡条件和稳态概率向量的矩阵几何解,并给出了系统的一些性能指标和数值结果.     

Geometric／G／1休假随机服务系统

本文讨论服务员休假的离散时间Geonletric/G/1排队系统。在多级适应性休假规则下,给出稳态队长、等待时间的分布和随机分解,也研究了忙期、全假期、在线期的分布。多重休假、单重休假、启动时间规则,都是本文中模型的特例。     

M/G/1非空竭服务休假排队系统随机分解的简化算法

本文根据M／G／1非空竭服务休假排队系统稳态队长随机分解的结构特征提出一种统一算法，该方法简洁高效，避免了再生循环方法繁杂的运算。运用该方法得出的结果与已知的用再生循环方法得出的结论一致。并且修正了Levy(1989)关于Bernoulli闸门服务休假排队系统随机分解的一个错误。     

具有相型服务分布的排队系统的性能灵敏度分析

具有非线数服务分布的排队网络已被广泛应用于许多领域,如通讯网络和管理系统。本文借助于无穷小说矩阵摄动方法,研究了M/PH/1排队系统的稳态性能灵敏度分析问题,给出了性能灵敏度公式,并表明了稳态性能灵敏度很容易通过系统势能进行计算。同时,给出一种计算势能及性能导数的算法。这个算法可直接用于系统的控制与优化,因为它基于分析系统的一条单一样本轨道。最后提供一个数值例子来表明这个算法的应用。     

相依修理的可修排队系统 MAP/PH(M/PH)/2

系统地研究了两个不同并行服务台的可修排队系统MAP/PH(M/PH)/2,其中两个不同的服务台拥有一个修理工.若其中一台处于修理状态,则另一台失效后就处于待修状态.利用拟生灭过程理论,我们首先讨论了两个服务台的广义服务时间的相依性,然后给出了系统的稳态可用度和稳态故障度,最后得到了系统首次失效前的时间分布及其均值.     

Matrix Product-Form Solution for an LCFS-PR Single-Server Queue with Multiple Arrival Streams Governed by a Markov Chain

This paper considers a stationary single-server queue with multiple arrival streams governed by a Markov chain, where customers are served on an LCFS preemptive-resume basis. Service times of customers from each arrival stream are generally distributed and service time distributions for different arrival streams may be different. Under these assumptions, it is shown that the stationary joint distribution of queue strings representing from which arrival stream each customer in the system arrived and remaining service times of respective customers in the system has a matrix product-form solution, where matrices constituting the solution are given in terms of the infinitesimal generator of a certain Markov chain. Compared with the previous works, the result in this paper is more general in the sense that general service time distributions are allowed, and it has the advantage of computational efficiency. Note also that the result is a natural extension of the classical result for the LCFS-PR M/G/1 queue. Further, utilizing the matrix product-form solution, we derive a new expression of the vector Laplace–Stieltjes transform of the stationary distribution of unfinished work in the work-conserving single-server queue with multiple arrival streams governed by a Markov chain, which is given by the sum of matrix-geometric series.     

具有成批到达和二次可选服务的Geo~([X])/Geo/1排队

在经典Geo/Geo/1排队系统的模型中引入成批到达和二次可选服务,研究了具有成批到达和二次可选服务的Geo/Geo/1排队模型.针对具体的系统模型建立了Markov链,使用矩阵几何解的方法,研究了系统的各项指标,得到了系统的稳态队长和等待时间分布的母函数,并给出了该模型的两个特例.     

Boundary Crossing for the Difference of Two Ordinary or Compound Poisson Processes

We consider the lower boundary crossing problem for the difference of two independent compound Poisson processes. This problem arises in the busy period analysis of single-server queueing models with work removals. The Laplace transform of the crossing time is derived as the unique solution of an integral equation and is shown to be given by a Neumann series. In the case of ±1 jumps, corresponding to queues with deterministic service times and work removals, we obtain explicit results and an approximation useful for numerical purposes. We also treat upper boundaries and two-sided stopping times, which allows to derive the conditional distribution of the maximum workload up to time t, given the busy period is longer than t.     

基于Vague集的第三方物流客户满意度评价方法研究

首先分析了已有研究中对第三方物流客户满意的评价指标体系,接着将Vague集评价思想引入到该领域中,借助偏差函数确定各个指标的权重,通过正负理想解的定义,确定待评价对象与正负理想解之间的距离,最后借助指标函数的定义得到了各个方案的评价值.研究成果对物流企业改善服务,提高市场竞争力具有一定的促进作用.     

Analytic Computation Schemes for the Discrete-Time Bulk Service Queue

In commonly used root-finding approaches for the discrete-time bulk service queue, the stationary queue length distribution follows from the roots inside or outside the unit circle of a characteristic equation. We present analytic representations of these roots in the form of sample values of periodic functions with analytically given Fourier series coefficients, making these approaches more transparent and explicit. The resulting computational scheme is easy to implement and numerically stable. We also discuss a method to determine the roots by applying successive substitutions to a fixed point equation. We outline under which conditions this method works, and compare these conditions with those needed for the Fourier series representation. Finally, we present a solution for the stationary queue length distribution that does not depend on roots. This solution is explicit and well-suited for determining tail probabilities up to a high accuracy, as demonstrated by some numerical examples.AMS subject classification: 42B05, 60K25, 68M20     

A Uniformly-Valid Asymptotic Solution to a Matrix System of Ordinary Differential Equations and a Proof of its Validity

A new multiple-scale perturbation technique is employed to find the approximate solution to a fairly general matrix system of ordinary differential equations. This system includes a linear part given by a slowly-varying matrix and a small nonlinear part. The general proof of the method given in previous work is used to show rigorously that the present approximate solution is indeed asymptotic to the solution of the differential system. Some typical special cases of the general solution are also given.     

A probabilistic model applied to emergency service vehicle location

This paper is concerned with the formulation and the solution of a probabilistic model for determining the optimal location of facilities in congested emergency systems. The inherent uncertainty which characterizes the decision process is handled by a new stochastic programming paradigm which embeds the probabilistic constraints within the traditional two-stage framework. The resulting model drops simplifying assumptions on servers independence allowing at the same time to handle the spatial dependence of demand calls. An exact solution method and different tailored heuristics are presented to efficiently solve the problem. Computational experience is reported with application to various networks.     

Queues with group arrivals and exhaustive service discipline

Queues with compound Poisson arrivals, phase-type service and exhaustive service discipline are studied. An algorithmic method is developed to compute the steady-state probability distribution of the number of customers in the system with unlimited or limited queue capacities. Examples with different model parameters are given to show the computational efficiency of the method. In the Appendix, the stochastic decomposition property for the queues with single arrivals and with exhaustive service discipline is extended to queues with group arrivals.     

考虑应急设施中断风险与防御的可靠性选址模型研究

为提高应急设施运行的可靠性和抵御中断风险的能力, 研究中断情境下的应急设施选址-分配决策问题。扩展传统无容量限制的固定费用选址模型, 从抵御设施中断的视角和提高服务质量的视角建立选址布局网络的双目标优化模型, 以应急设施的建立成本和抵御设施中断的加固成本最小为目标, 以最大化覆盖服务质量水平为目标, 在加固预算有限及最大最小容量限制约束下, 构建中断情境下应急设施的可靠性选址决策优化模型。针对所构建模型的特性利用非支配排序多目标遗传算法(NSGA-Ⅱ)求解该模型, 得到多目标的Pareto前沿解集。以不同的算例分析和验证模型和算法的可行性。在获得Pareto前沿的同时对不同中断概率进行灵敏度分析, 给出Pareto最优解集的分布及应急设施选址布局网络的拓扑结构。     

On two expressions of the MLE for a special case of the extended growth curve models

An algebraic proof is given on the equivalence between two solutions of MLEs for a special case of the extended growth curve models called the Banken model. One solution given by Verbyla and Venables is an iterative solution in the general case but reduces to a non-iterative one in the case of the Banken model. The other solution given by von Rosen is a closed-form solution specifically targeted at the Banken model. The proof has turned out to be quite challenging yet intriguing as it touches on many aspects of intricate matrix theory involving projection matrices.