Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing

We consider characterizations of departure functions in Markovian queueing networks with batch movements and state-dependent routing in discrete-time and in continuous-time. For this purpose, the notion of structure-reversibility is introduced, which means that the time-reversed dynamics of a queueing network corresponds with the same type of queueing network. The notion is useful to derive a traffic equation. We also introduce a multi-source model, which means that there are different types of outside sources, to capture a wider range of applications. Characterizations of the departure functions are obtained for any routing mechanism of customers satisfying a recurrent condition. These results give a unified view to queueing network models with linear traffic equations. Furthermore, they enable us to consider new examples as well as show limited usages of this kind of queueing networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

土地资源多级网格平台高效处理机制研究

为实现海量土地资源数据多级网格管理和高效处理,设计了基于网格服务架构的土地资源多级网格化管理平台LR-MGSP（Land Resource Multi-Grid Service Platform）,从网格任务分解、空间信息服务缓存和增量统计等方面探讨了提高平台处理性能的策略和方法.原型平台与非网格化的土地资源管理系统的性能对比测试结果表明,LR-MGSP达到了预期的目标,能够满足海量土地资源数据高效管理和处理的需求,也为其他行业开展跨机构协同处理海量空间数据工作提供了借鉴.     

An M/G/1 system with startup server and J additional options for service

We consider an M^[x]/G/1 queueing system with a startup time, where all arriving customers demand first the essential service and some of them may further demand one of other optional services: Type 1, Type 2, … , and Type J service. The service times of the essential service and of the Type i  (i=1,2,…,J)$(i=1\text{,}2\text{,}\dots \text{,}J)$ service are assumed to be random variables with arbitrary distributions. The server is turned off each time when the system is empty. As soon as a customer or a batch of customers arrives, the server immediately performs a startup which is needed before starting each busy period. We derive the steady-state results, including system size distribution at a random epoch and at a departure epoch, the distributions of idle and busy periods, and waiting time distribution in the queue. Some special cases are also presented.     

回报型众筹定价模型

构建了众筹融资、向支持者提供产品和向普通消费者出售产品的回报型众筹三阶段模型,研究兼顾增加发起人收益与提高项目众筹成功率的发起人定价决策,并运用比较静态方法探讨了发起人给支持者提供的增值服务和投资者的消费耐心程度因素对发起人定价决策的影响。研究表明,发起人与消费者是一个关于价格和效用的动态博弈过程,并最终达到纳什均衡;支持者所得的增值服务和消费者消费的时间偏好在改善发起人收益与项目众筹成功率之间并不协同,因此发起人的产品定价和筹资目标设定应折中设置在一个合理的范围。结论为发起人合理的产品定价和项目筹资成功率的提高提供一定理论依据和实践参考。     

基于演化博弈的制造企业服务创新扩散研究

制造企业服务化是我国实现制造强国的必经之路,本文以“中国制造2025”战略为背景,通过借鉴创新扩散和演化博弈理论,对社会系统中参与服务创新的相关主体进行分析,构建政府与企业之间演化博弈模型,结合并改进Bass经典创新扩散模型,探究政府规制行为对企业服务创新行为演化及扩散的影响,利用Matlab对复制动态方程和扩散模型进行数学推导和数值仿真分析。结果表明:当满足政府的社会总收益大于其调控成本和各项补贴总额且企业选择服务创新策略时收益的额外增加额大于其实际投入时,系统才会演化至政府调控且企业采纳服务创新的稳定状态;适当增加政府对企业的调控力度、投入补贴和税收补贴有助于推进服务创新在系统中的扩散,其中税收补贴的感知能力最强,投入补贴最弱;将抑制系数引入Bass创新扩散模型,构建互补型、竞争型和替代型三种服务创新的扩散模式,其中竞争型扩散符合中国现阶段市场规律,替代性扩散将成为未来制造企业的发展趋势。     

考虑占位决策的围堵嫌犯模型

研究了2011年中国大学生数学建模竞赛B题的突发事件中交巡警对在逃嫌犯的围堵问题。不同于对该问题的以往的研究,本文考虑了交巡警在包围圈中可以占据某些路口,使得嫌犯不能通过这些被交巡警占据的路口,从而为形成包围圈的交巡警赢得更多时间。利用两篇相关文献的关于点截集判断的结论和考虑占位决策的建模方法,以不同的目标函数建立了考虑占位决策的围堵嫌犯问题的三个混合0-1非线性整数规划模型。通过选取部分线性约束和目标函数一起组合成混合0-1线性整数规划模型,设计了基于混合0-1线性整数规划方法的算法,并给出了算例。     

基于排队的两类顾客易逝品库存控制策略研究

本文采用排队理论在面向两类顾客需求的环境下讨论易逝品库存排队系统控制策略问题。首先刻画面向两类顾客服务且具有马尔科夫结构的易逝品库存系统排队模型,获得库存水平状态的稳态概率分布以及作为库存成本控制的系统稳态性能指标。接下来,构建库存控制成本函数及考虑服务水平约束的库存控制优化模型,设计了改进的遗传算法。最后,数值算例揭示出系统参数的敏感性和相应的管理启示。     

电商平台主导的E-闭环供应链定价、服务决策与回收模式

E-闭环供应链(E-CLSC)管理须有科学的定价与服务决策支撑。针对集中和分散回收模式,构建电商平台主导的Stackelberg博弈模型,研究E-CLSC定价与平台服务决策。通过对产品销售价格、平台服务水平等均衡策略分析,揭示回收主体投资有效性、回收转移价格等对E-CLSC均衡策略影响。研究表明:集中回收模式优于分散回收模式;在分散回收模式下,若回收主体投资有效性相同,制造商、平台均偏好制造商回收模式;平台回收与第三方回收模式相比,产品销售价格、平台服务水平相同,前者回收渠道效率较高;平台回收模式下,单位佣金与回收转移价格负相关,产品销售价格、平台服务水平、废旧产品回收率均与回收转移价格无关;若回收主体投资有效性差异程度较大,制造商回收模式并非总是最优的,回收主体投资有效性差异显著影响产品销售价格、回收渠道效率、平台服务水平和E-CLSC各成员利润。上述结论通过数值仿真进行了验证。     

基于中智犹豫模糊语言优先QUALIFLEX方法的绿色供应商选择

针对绿色供应商选择过程中,评价指标数量明显超过可供选择的供应商数量且指标之间存在优序关系等特点,提出了基于中智犹豫模糊语言优先QUAL-IFLEX方法的绿色供应商选择方法.首先,利用中智犹豫模糊语言表征评价信息和评价权重;其次,构造优先矩阵对指标权重做精确化处理,考虑到决策者对指标的要求和指标之间的优序关系,对指标权重...