带负顾客的Geom/Geom/1单重休假排队(英文)

本文研究了正负顾客到达均服从几何分布,服务台在工作休假期以较低的服务速率运行的 Geom/Geom/1休假排队.运用嵌入马尔科夫链和矩阵分析法,得到了系统中等待队长和稳态队长的概率母函数,并从证明过程和结果中,分别得到了服务台在闲期、忙期、工作休假期、正规忙期的概率.     

Approximation of M/M/s/K retrial queue with nonpersistent customers

We consider the M/M/s/K retrial queues in which a customer who is blocked to enter the service facility may leave the system with a probability that depends on the number of attempts of the customer to enter the service facility. Approximation formulae for the distributions of the number of customers in service facility, waiting time in the system and the number of retrials made by a customer during its waiting time are derived. Approximation results are compared with the simulation.     

关系感知在银行业顾客忠诚形成中的中介机制研究

以银行业为背景,以顾客关系感知中的满意和信任为中介变量,建立企业形象、转换成本和服务质量三个典型营销要素影响顾客忠诚意向和忠诚行为的概念模型,并进行了实证检验.研究发现:企业形象、服务质量和转换成本会显著影响顾客忠诚行为,其中服务质量影响最大;顾客满意在企业形象和服务质量对顾客忠诚行为的影响中有不完全中介作用;信任在服务质量对顾客忠诚行为的影响中也有不完全中介作用.此外,顾客忠诚意向是营销要素影响顾客忠诚行为的重要中介变量.     

Equilibria of a class of transport equations arising in congestion control

We consider a multi-queue multi-server system with n servers (processors) and m queues. At the system there arrives a stationary and ergodic stream of m different types of requests with service requirements which are served according to the following k-limited head of the line processor sharing discipline: The first k requests at the head of the m queues are served in processor sharing by the n processors, where each request may receive at most the capacity of one processor. By means of sample path analysis and Loynes’ monotonicity method, a stationary and ergodic state process is constructed, and a necessary as well as a sufficient condition for the stability of the m separate queues are given, which are tight within the class of all stationary ergodic inputs. These conditions lead to tight necessary and sufficient conditions for the whole system, also in case of permanent customers, generalizing an earlier result by the authors for the case of n=k=1. This work was supported by a grant from the Siemens AG.     

A Solution Method for a Two-dispatch Delivery Problem with Stochastic Customers

We study a vehicle routing problem in which vehicles are dispatched multiple times a day for product delivery. In this problem, some customer orders are known in advance while others are uncertain but are progressively realized during the day. The key decisions include determining which known orders should be delivered in the first dispatch and which should be delivered in a later dispatch, and finding the routes and schedules for customer orders. This problem is formulated as a two-stage stochastic programming problem with the objective of minimizing the expected total cost. A worst-case analysis is performed to evaluate the potential benefit of the stochastic approach against a deterministic approach. Furthermore, a sample-based heuristic is proposed. Computational experiments are conducted to assess the effectiveness of the model and the heuristic.      

Inventory with service time and transfer of customers and/inventory

An inventory system with two parallel service facilities is considered. A certain number of customers are transferred from longer to shorter queue whenever their difference reaches a prescribed quantity. Along with this customer transfer, a certain quantity of inventory is also transferred, depending on availability. Further, if one of the queues has customers, but has no inventoried items whereas the other has at least one inventoried item to spare, then exactly one item is taken to the former and service begins thereby enhancing the efficiency of the system. Stability of the system is analysed. Several performance measures that helps in efficient design of such systems, are computed. Some numerical results are provided.     

A single-server discrete-time queue with correlated positive and negative customer arrivals

An MMBP/Geo/1 queue with correlated positive and negative customer arrivals is studied. In the infinite-capacity queueing system, positive customers and negative customers are generated by a Bernoulli bursty source with two correlated geometrically distributed periods. I.e., positive and negative customers arrive to the system according to two different geometrical arrival processes. Under the late arrival scheme (LAS), two removal disciplines caused by negative customers are investigated in the paper. In individual removal scheme, a negative customer removes a positive customer in service if any, while in disaster model, a negative customer removes all positive customers in the system if any. The negative customer arrival has no effect on the system if it finds the system empty. We analyze the Markov chains underlying the queueing systems and evaluate the performance of two systems based on generating functions technique. Some explicit solutions of the system, such as the average buffer content and the stationary probabilities are obtained. Finally, the effect of several parameters on the system performance is shown numerically.     

晚清四大家词共通的情感倾向及其审美特征

晚清四大家遭亘古未有之变,怵于危亡,观照君国与自我,在政治与生命的挣扎中,真实深刻地传达了易代之际传统文人的特殊心态与情感。他们秉承温柔敦厚的传统,以比兴写哀怨,托物兴寄,组织缠绵悱恻的情感形态,朦胧迷离的意境,从而呈现出阴柔关与悲情关。     

The m/g/1 retrial queue with nonpersistent customers

We consider anM/G/1 retrial queue in which blocked customers may leave the system forever without service. Basic equations concerning the system in steady state are established in terms of generating functions. An indirect method (the method of moments) is applied to solve the basic equations and expressions for related factorial moments, steady-state probabilities and other system performance measures are derived in terms of server utilization. A numerical algorithm is then developed for the calculation of the server utilization and some numerical results are presented.     

The MM CPP/GE/c G-Queue: Sojourn Time Distribution

We obtain the sojourn time probability distribution function at equilibrium for a Markov modulated, multi-server, single queue with generalised exponential (GE) service time distribution and compound Poisson arrivals of both positive and negative customers. Such arrival processes can model both burstiness and correlated traffic and are well suited to models of ATM and other telecommunication networks. Negative customers remove (ordinary) customers in the queue and are similarly correlated and bursty. We consider both the cases where negative customers remove positive customers from the front and the end of the queue and, in the latter case, where a customer currently being served can and cannot be killed by a negative customer. These cases can model an unreliable server or load balancing respectively. The results are obtained as Laplace transforms and can be inverted numerically. The MM CPP/GE/c G-Queue therefore holds the promise of being a viable building block for the analysis of queues and queueing networks with bursty, correlated traffic, incorporating load balancing and node-failures, since the equilibrium behaviour of both queue lengths and response times can be determined in a tractable way.