物流客户服务水平的综合评价研究

本文在客户问卷调查的基础上,结合国外有关的物流企业客户服务指标,建立了物流客户服务水平评价的指标体系,同时应用定性与定量分析相结合的方法,建立了属性综合评价的物流客户服务水平评价模型,并给出了具体的应用实例.     

物流服务供应商联盟构建及分析

在分析供应链环境下物流服务运作的基础上,建立了信息对称情况下物流服务供应商分散控制和集中控制策略模型,并从物流服务联盟的总体产出效果和物流服务联盟对盟员利润的影响两个方面对其进行了定量分析,结果表明,建立物流服务联盟有利于增加联盟产出,抑制竞争对手的产出;如果物流服务企业之间有增加合作利润的需要,则都有建立联盟的积极性.最后对物流服务联盟的实现机理进行了分析.     

垄断服务系统公共损耗费用分摊理论基础分析

就具有最简单结构的抽象垄断服务系统的基本特性及其公共损耗的费用分摊问题建立了较为完整的公平性与合理性公理体系.同时,利用边际损耗原则导出了一类满足公理组的费用分摊方法,并将所得结论应用于电力系统有功网损费用分摊问题,从理论上统一了现有的几类主要的分摊方法.分析结论表明:损耗结构分析和费用分摊原则的确定在本质上从属于不同层次的问题.特别地,对不分明损耗而言:它们还是不可分割的统一体.对这一类问题进行描述必须考虑综合运用数学、社会学、经济学和方法论原则.     

一个具有随机丢弃分组机制且分组成批到达的GI~X/M/1/N排队系统

利用排队论中输入流稀疏化的方法,在标准的GIX/M/1/N排队系统中嵌入网络交换设备随机丢弃分组的机制,建立了一个具有随机丢弃分组机制的扩充的GIX/M/1/N排队系统,并讨论了该排队系统的分组丢失率、系统利用率、队列长度的均值/方差、平均等待时间等性能评价指标.     

一类具有到达损失、可选服务、反馈的M/G/1重试排队系统

考虑一个具有到达损失、可选服务、反馈的M/G/1重试排队系统.在假定重试区域中顾客具有相互独立的指数重试时间的情况下,得到了系统的转移概率矩阵和系统稳态的充分必要条件.列出微分方程,求得稳态时系统队长和重试区域中队长分布及相关指标.     

A duality relation for busy cycles inGI/G/1 queues

Using a generalization of the classical ballot theorem, Niu and Cooper [7] established a duality relation between the joint distribution of several variables associated with the busy cycle inM/G/1 (with a modified first service) and the corresponding joint distribution of several related variables in its dualGI/M/1. In this note, we generalize this duality relation toGI/G/1 queues with modified first services; this clarifies the original result, and shows that the generalized ballot theorem is superfluous for the duality relation.     

动态输入率和服务率设定下的M/M/c模型扩展及其应用

为了解决M/M/c模型中恒定输入率和服务率假设与现实现象不符的问题,本文提出了随系统状态变化的输入概率和服务度,并通过新输入概率与平均输入率以及新服务度与平均服务率的结合分别构造了动态输入率和服务率。基于上述动态输入率和动态服务率,建立了依赖系统当前状态的状态转移过程,从状态转换强度方面优化了排队理论及其度量模型,同时,设计了结合系统实际的后确定法求解动态输入率与服务率的相关参数,从而构建了扩展M/M/c模型。由于输入率和服务率的动态性,扩展M/M/c模型具有比原排队论模型更广的适用范围和精度更高的模拟结果。最后,通过一个生活实例对新模型的有效性和实用性进行验证。     

A large closed queueing network with autonomous service and bottleneck

This paper studies the queue-length process in a closed Jackson-type queueing network with the large number N of homogeneous customers by methods of the theory of martingales and by the up- and down-crossing method. The network considered here consists of a central node (hub), being an infinite-server queueing system with exponentially distributed service times, and k single-server satellite stations (nodes) with generally distributed service times with rates depending on the value N. The service mechanism of these k satellite stations is autonomous, i.e., every satellite server j serves the customers only at random instants that form a strictly stationary and ergodic sequence of random variables. Assuming that the first k-1 satellite stations operate in light usage regime the paper considers the cases where the kth satellite station is a bottleneck node. The approach of the paper is based both on development of the method from the paper by Kogan and Liptser [16], where a Markovian version of this model has been studied, and on development of the up- and down-crossing method. This revised version was published online in June 2006 with corrections to the Cover Date.     

Sojourn time asymptotics in the M/G/1 processor sharing queue

We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index -ν, ν non-integer, iff the sojourn time distribution is regularly varying of index -ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution. We show how the moments of the sojourn time can be calculated recursively and prove that the kth moment of the sojourn time is finite iff the kth moment of the service time is finite. In addition, we give a short proof of a heavy traffic theorem for the sojourn time distribution, prove a heavy traffic theorem for the moments of the sojourn time, and study the properties of the heavy traffic limiting sojourn time distribution when the service time distribution is regularly varying. Explicit formulas and multiterm expansions are provided for the case that the service time has a Pareto distribution. This revised version was published online in June 2006 with corrections to the Cover Date.     

差异化需求下考虑患者预约行为的医疗服务供需匹配方法

如何根据患者的差异化需求,撮合医生与患者双方形成合理有效的医疗服务供需匹配,是医疗服务运作管理中重要的研究问题。本文针对医疗服务中医生与患者的实际需求,提出了一种考虑患者预约行为的匹配决策方法。在该方法中,首先依据患者的预约行为及特征分类;然后,通过计算不同情形下医患双方的差异度,获得了医患双方的满意度矩阵;在此基础上,提出了匹配预约患者与医生的E-HR算法,并进一步构建了匹配剩余患者和医生的多目标优化模型,通过模型求解得到最优匹配结果;最后,通过算例说明了本文提出方法的可行性和实用性。