具有可选服务的M/M/l排队模型的豫解集

运用线性算子及其共轭算子的谱之间的关系,研究具有可选服务的M/M/1排队模型主算子的豫解集,并得到在虚轴上除了零外其它所有点都属于该算子的豫解集.     

动态联合库存的决策模型及算法

考虑生产商、销售商联合库存的动态优化问题,建立的随机需求下生产-销售运作系统的排队模型,得到了系统的稳态概率分布和队长分布.以成本最小化为目标,模型算法找到了最优的运作策略和机器使用数量.数值模拟的结果表明,依赖于指定机器数量的动态调整策略明显优于静态系统.     

Multigrid algorithm from cyclic reduction for Markovian queueing networks

A multigrid method based on cyclic reduction strategy is proposed to solve huge, nonsymmetric singular linear systems arising from Markovian queueing networks. A simple way to construct the matrix-dependent prolongation and restriction operators is presented in this paper. Numerical results for multiple queues are given to illustrate the efficiency and robustness of our methods.     

Effect of Modeling Uncertainty on Some Routing Problems

In this paper, we consider the routing problem described in Mohanty and Cassandras (Ref. 1). As in Ref. 1, we show that the optimal Bernoulli split to minimize mean time in the system is asymptotically independent of the variance of the service time. We give simple proofs of the results in that paper. We exploit the fact that the optimal split to minimize the mean queueing time is variance independent and the special structure of the Karush–Kuhn–Tucker optimality conditions to derive the optimal solution. Apart from being very straightforward, the proofs also give insight into the reason for the existence of the variance-independent asymptotically optimal routing policy.     

A Simple proof for the stability of global FIFO queueing networks

We study the stability of multiclass queueing networks under the global FIFO （first in first out） service discipline, which was established by Bramson in 2001. For these networks, the service priority of a customer is determined by his entrance time. Using fluid models, we describe the entrance time of the most senior customer in the networks at time t, which is the key to simplify the proof for the stability of the global FIFO queueing networks.     

Product form in networks of queues with batch arrivals and batch services

A product form equilibrium distribution is derived for a class of queueing networks in either discrete or continuous time, in which multiple customers arrive simultaneously and batches of customers complete service simultaneously.     

On the asymmetric clocked buffered switch

A 2 × 2 clocked buffered switch is a device used in data-processing networks for routing messages from one node to another. The message handling process of this switch can be modelled as a two-server, time slotted, queueing process with state space the number of messages (x_n , y_n) present at the servers at the end of a time slot. The x_n , y_n-process is a two-dimensional nearest-neighbour random walk. In the present study the bivariate generating function Φ(p,q) of the stationary distribution of this random walk is determined, assuming that this distribution exists. Φ(p,q) is known, whenever Φ(p,0) and Φ(0,q) are known. The essential points of the present study are the construction of these two functions from the knowledge of their poles and zeros and the simple determination of these poles and zeros. This revised version was published online in June 2006 with corrections to the Cover Date.     

THE POINT PROCESS OF STATETRANSITIONS IN AREGULAR MARKOV CHAIN

1.IntroductionInreliabilitytheory,inordertocalculatethefailurefrequencyofarepairablesystem,Shily]firstintroducedandstudiedthetransitionfrequencybetweentwodisjointstatesetsforafiniteMarkovchainandavectorMarkovprocesswithfinitediscretestatespaceandobtainedageneralformulaoftransitionfrequency.Then,ontheconditionthatthegeneratormatrixofMarkovchainisuniformlybounded,Shi[8'9]againprovedthetransitionfrequencyformulaandobtainedthreeotherusefulformulas.Obviously,thepoint(orcalledcounting)processofsta…     

Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting

This paper presents a priority rule-based heuristic for the multi-mode resource-constrained project scheduling problem with the splitting of activities around unavailable resources allowed. All resources considered are renewable and each resource unit may not be available at all times due to resource vacations, which are known in advance. A new concept called moving resource strength is developed to help identify project situations where activity splitting is likely to be beneficial during scheduling. The moving resource strength concept is implemented in priority rule-based heuristics to control activity splitting when scheduling. Multiple comparisons of the performance of combination of activity–mode priority rules used in the heuristics are provided. Computational experiments demonstrate the effectiveness of the heuristic in reducing project makespan, and minimizing activity splitting.     

A chi-square method for obtaining a priority vector from multiplicative and fuzzy preference relations

Decision makers (DMs)’ preferences on decision alternatives are often characterized by multiplicative or fuzzy preference relations. This paper proposes a chi-square method (CSM) for obtaining a priority vector from multiplicative and fuzzy preference relations. The proposed CSM can be used to obtain a priority vector from either a multiplicative preference relation (i.e. a pairwise comparison matrix) or a fuzzy preference relation or a group of multiplicative preference relations or a group of fuzzy preference relations or their mixtures. Theorems and algorithm about the CSM are developed. Three numerical examples are examined to illustrate the applications of the CSM and its advantages.