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

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

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

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

Analysis of a time-limited service priority queueing system with exponential timer and server vacations

We consider a multi-class priority queueing system with a non-preemptive time-limited service controlled by an exponential timer and multiple (or single) vacations. By reducing the service discipline to the Bernoulli schedule, we obtain an expression for the Laplace-Stieltjes transform (LST) of the waiting time distribution via an iteration procedure, and a recursive scheme to calculate the first two moments. It is noted that we have to select embedded Markov points based on the service beginning epochs instead of the service completion epochs adopted for most of M/G/1 queueing analyses. Through the queue-length analysis, we obtain a decomposition form for the LST of the waiting time in each queue having the exhaustive service.      

Three-level warranty service contract among manufacturer,agent and customer: A game-theoretical approach

A warranty is a service contract between a manufacturer and a customer which plays a vital role in many businesses and legal transactions. In this paper, various three-level service contracts will be presented among the following three participants; a manufacturer, an agent, and a customer. In order to obtain a better result, the interaction between the aforementioned participants will be modeled using the game theory approach. Under non-cooperative and semi-cooperative games, the optimal sale price, warranty period and warranty price for the manufacturer and the optimal maintenance cost or repair cost for the agent are obtained by maximizing their profits. The satisfaction of the customer is also maximized by being able to choose one of the suggested options from the manufacturer and the agent, based on the risk parameter. Several numerical examples and managerial insights are presented and used to illustrate the models presented in this paper.     

基于网络外部性的港口FDI企业与内资港口企业博弈策略研究

将港口服务产品的网络外部性和服务质量水平引入到发货人的效用函数中,通过Hotelling价格竞争模型分析港口FDI企业与内资港口企业的博弈策略行为,分别研究在Nash和Stackelberg博弈条件下,港口服务价格、收益与网络外部性系数、服务质量水平之间的关系.理论研究的结论表明:港口FDI企业与内资港口企业在Stackelberg条件下的最优定价、均衡收益均大于Nash条件下的最优定价、均衡收益;企业最优定价随网络外部性强度线性递减,随服务水平线性递增;企业均衡收益受服务水平和网络外部性强度的影响,呈现出一定的区间变化规律,处于相同港口外部市场环境下,内资港口企业与港口FDI企业的服务策略选择和侧重点不相同.     

面向不确定需求租户集的云服务智能匹配模型

为了解决云计算环境下由海量租户集和资源集间的不确定性因素引起的高质量云服务获取困难的问题,提出了一种描述动态异构租户集不确定性需求的方法.在此基础上,构建属性权重完全未知情况下的云服务智能匹配模型,排除了租户提交权值造成的偏差.神经网络以属性区间计算的相离度作为输入,服务满意度为输出来动态模拟租户集的不确定需求,运用萤火虫算法求解模型获取最优服务组合.最后,实例验证了神经网络的可靠性以及算法的有效性.实验结果表明,模型能有效获取高质量的云服务组合,优于传统的匹配方法.     

A probabilistic quality of service constraint for a location model of switches in ATM communications networks

We formulate a model for the optimal location of switches in ATM communications networks. The networks are designed in such a way that, at their arrival to the switches, ATM cells find free space in a buffer of length b, with a probability α. The model avoids the impairment to the communication caused by both cell loss (because of shorter buffers) and cell-delay variations (because of longer buffers). It is also shown how to transform a non-linear, probabilistic, constraint into a linear form. Computational experience is provided for the model. This revised version was published online in June 2006 with corrections to the Cover Date.     

Astronomical function and date of the Taosi observatory

The Taosi site in Xiangfen County, Shanxi Province, may be the capital of the King Yao. Archeologists recently discovered a large semi-circular stamped-earth platform, II FJT1, which has a clear and definite pounded-earth central core together with a curved wall perforated by twelve gaps. The platform is said to be an ancient observatory used to determine the seasons by watching the sunrise. Each feature of II FJT1 was precisely measured and the data are reproduced in this paper. An astronomical analysis of slots E2 and E12 was carried out using the azimuths of the slots’ centerlines and the vertical angle of the mountain ridge opposite, above which the sun rises. The results show that at present the sun is close to the two slots but does not exactly enter them at summer and winter solstice sunrise. Using 14C analysis archeologists dated the site to about 2100 BC. Because of the secular change in the obliquity of the ecliptic, at that date on the summer solstice the half-risen sun would have appeared inside slot E12 just to the right of the centerline, and on the winter solstice the sun would have been exactly on the centerline of slot E2. This result provides compelling proof that II FJT1 is an ancient observatory.     

Mean value analysis for polling systems

The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic simplicity and its intuitively appealing derivation. As a consequence, MVA may be applied, both in an exact and approximate manner, to a large variety of models.     

Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service

A sojourn time analysis is provided for a cyclic-service tandem queue with general decrementing service which operates as follows: starting once a service of queue 1 in the first stage, a single server continues serving messages in queue 1 until either queue 1 becomes empty, or the number of messages decreases to k less than that found upon the server's last arrival at queue 1, whichever occurs first, where 1 ≤ k ≤ ∞. After service completion in queue 1, the server switches over to queue 2 in the second stage and serves all messages in queue 2 until it becomes empty. It is assumed that an arrival stream is Poissonian, message service times at each stage are generally distributed and switch-over times are zero. This paper analyzes joint queue-length distributions and message sojourn time distributions.