Analysis of GI<Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>(<Emphasis Type="Italic">n</Emphasis>)//<Emphasis Type="Italic">N</Emphasis> systems with stochastic customer acceptance policy

We investigate GI ^X /M(n)//N systems with stochastic customer acceptance policy, function of the customer batch size and the number of customers in the system at its arrival. We address the time-dependent and long-run analysis of the number of customers in the system at prearrivals and postarrivals of batches and seen by customers at their arrival to the system, as well as customer blocking probabilities. These results are then used to derive the continuous-time long-run distribution of the number of customers in the system. Our analysis combines Markov chain embedding with uniformization and uses stochastic ordering as a way to bound the errors of the computed performance measures.      

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.      

Scheduling networks of queues: Heavy traffic analysis of a simple open network

We consider a queueing network with two single-server stations and two types of customers. Customers of type A require service only at station 1 and customers of type B require service first at station 1 and then at station 2. Each server has a different general service time distribution, and each customer type has a different general interarrival time distribution. The problem is to find a dynamic sequencing policy at station 1 that minimizes the long-run average expected number of customers in the system.The scheduling problem is approximated by a dynamic control problem involving Brownian motion. A reformulation of this control problem is solved, and the solution is interpreted in terms of the queueing system in order to obtain an effective sequencing policy. Also, a pathwise lower bound (for any sequencing policy) is obtained for the total number of customers in the network. We show via simulation that the relative difference between the performance of the proposed policy and the pathwise lower bound becomes small as the load on the network is increased toward the heavy traffic limit.     

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.     

Optimal admission control for two station tandem queues with loss

We consider a two-station tandem queue with a buffer size of one at the first station and a finite buffer size at the second station. Silva et al. (2013) gave a criterion determining the optimal admission control policy for this model. In this paper, we improve the results of Silva et al. (2013) and also solve the problem conjectured by Silva et al. (2013).     

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

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

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

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

服役温度对多壁碳纳米管/Li1.18Ni0.15Co0.15Mn0.52O2复合正极材料性能的影响

通过煅烧的方式制得多壁碳纳米管(MWCNT)质量分数为3%的MWCNT/Li1.18Ni0.15Co0.15Mn0.52O2锂离子电池复合正极材料,并测试了复合正极材料在不同服役温度环境下的电化学性能:-20和60℃下服役时,其放电容量分别高达169、303 mAh·g^-1,且展示出良好的倍率性能和循环稳定性。结合电化学阻抗测试结果可知,MWCNT均匀附着在层状粒子的表面,有效减少了电解液对电极材料的侵蚀,阻碍了表面膜的生成,同时提高了材料的电子电导率。