机场任务指派问题的优化方案研究

本文研究了机场任务指派问题,该问题是指将具有特殊属性的任务指派给有限数量的班次。由于机场任务和班次属性的多样性,机场任务指派问题是一个复杂的组合优化问题,属于NP-完全问题。本文以任务完成产生的效益总和最大化为目标建立数学优化模型,提出有效不等式,应用CPLEX软件对实际数据进行求解,结果表明,CPLEX可以在较短时间内对一定规模的算例求得最优解。同时对影响目标函数的四个因素:任务数量、班次数量、班次工作时长和任务属性分别进行分析,通过实际算例测试对比,得出具有指导意义的结论,即根据机场特征分别调整四个因素不仅能够提高机场资源的有效利用率,而且能够提高机场的运行效率和服务水平。     

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.     

FUNCTIONAL ANALYSIS METHOD FOR THE M/G/1 QUEUEING MODEL WITH OPTIONAL SECOND SERVICE

By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point.     

软件服务供应链合同设计与协调策略

考虑了整合式软件服务供应链和分散式软件服务供应链两种模式,以整合供应链为基准对分散供应链下的软件开发合同设计与协调问题进行了研究。在分散供应链下,分析了固定价格合同、销量激励合同和成本分担合同三种合同对供应链收益的影响,探索了这些合同的激励机制,考察了这些合同的适用环境。研究表明:三种合同中,成本分担合同对软件开发商的激励最高,达到了整合供应链下的协调水平;固定价格合同适用于软件用户对质量不太注重而对价格比较敏感、以及开发成本较高的情形,销量激励合同适用于软件用户对质量比较注重而对价格不太敏感、以及开发成本较低的情形,成本分担合同适用于平台运营商易于监测软件开发商开发成本的情形。     

检验检测服务模式研究

检验检测服务模式发展滞后于检验检测行业发展的重要原因之一就是缺乏针对于服务模式的理论定义。采用概念分析法,以服务模式的定义和检验检测行业的服务特点为逻辑,研究了相关的代表性理论,认为服务模式主要由服务的基本要素和服务的商业模式两方面的内容组成,并深入探讨了检验检测的服务模式,提出了构建检验检测服务模式这一概念的重要意义。     

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

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

A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime

Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival to queue 1 while the server is still working in queue 0, the latter is immediately gated, and the server completes service there only to the gated jobs, upon which it switches back to the primary queue. We formulate this system as a two-queue polling model with a single alternating server and with randomly-timed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive Laplace–Stieltjes transforms and generating functions for various key variables and calculate numerous performance measures such as mean queue sizes at polling instants and at an arbitrary moment, mean busy period duration and mean cycle time length, expected number of messages transmitted during a busy period and mean waiting times. Finally, we present graphs of numerical results comparing the mean waiting times in the two queues as functions of the relative loads, showing the effect of the RTG regime.     

Sojourn times in a processor sharing queue with service interruptions

We study the sojourn times of customers in an M/M/1 queue with the processor sharing service discipline and a server that is subject to breakdowns. The lengths of the breakdowns have a general distribution, whereas the on-periods are exponentially distributed. A branching process approach leads to a decomposition of the sojourn time, in which the components are independent of each other and can be investigated separately. We derive the Laplace–Stieltjes transform of the sojourn-time distribution in steady state, and show that the expected sojourn time is not proportional to the service requirement. In the heavy-traffic limit, the sojourn time conditioned on the service requirement and scaled by the traffic load is shown to be exponentially distributed. The results can be used for the performance analysis of elastic traffic in communication networks, in particular, the ABR service class in ATM networks, and best-effort services in IP networks.     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.