Lowest priority waiting time distribution in an accumulating priority Lévy queue

We derive the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive Lévy input. The priority of an infinitesimal customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. To this end we introduce a new method that relies on the construction of a workload overtaking process and solving a first-passage problem using an appropriate stopping time.     

A tree search method for the container loading problem with shipment priority

This paper addresses a special kind of container loading problem with shipment priority. We present a tree search method, which is based on a greedy heuristic. In the greedy heuristic, blocks made up of identical items with the same orientation are selected for packing into a container. Five evaluation functions are proposed for block selection, and the different blocks selected by each evaluation function constitute the branches of the search tree. A method of space splitting and merging is also embedded in the algorithm to facilitate efficient use of the container space. In addition, the proposed algorithm covers an important constraint called shipment priority to solve practical problems. The validity of the proposed algorithm is examined by comparing the present results with those of published algorithms using the same data.     

直觉判断矩阵的弱传递性与加型一致性研究

定义了直觉判断矩阵的有向图和有向路概念,证明在一定的条件下直觉判断矩阵的有向图有唯一有向路.利用该结论给出一个简洁的排序方法,并指出这种方法的不足之处.通过反例说明了直觉判断矩阵已有的加型一致性概念与弱传递性概念之间没有必然强弱关系.根据直觉模糊数的得分值和精确度值,利用效用的思想给出直觉判断矩阵加型一致性的新定义,并证明了新定义的加型一致性具有弱传递性.针对一般的直觉判断矩阵, 运用新定义的加型一致性概念以及偏差函数的方法给出了求解直觉判断矩阵的直觉模糊数型权重的模型,并通过算例验证了决策方法的实用性.     

基于最小偏差和优势度的区间数互补判断矩阵排序法

针对决策信息以区间数互补判断矩阵形式给出的多目标决策问题。首先,给出相对优势度的概念和区间数加性一致性互补判断矩阵的判定定理。其次,建立一个目标规划模型,通过求解该模型得到区间数互补判断矩阵的权重向量,并利用各权重向量的总体相对优势度对方案进行排序,提出了基于最小偏差和优势度的区间数互补判断矩阵排序法。方法的核心是对数值型互补判断矩阵排序方法的拓展。最后,通过实例说明方法的可行性和有效性。     

基于结构元方法的模糊数互补判断矩阵排序法

利用模糊结构元方法,研究了决策信息以模糊数互补判断矩阵形式给出的有限方案决策问题。给出了模糊数互补判断矩阵的定义,介绍了模糊数排序的一种简捷方法——组合序。在该序的基础上,对模糊有序加权平均(FOWA)算子的若干性质进行证明。利用该算子能够将模糊数互补判断矩阵转换为实数矩阵,进而,对模糊数互补矩阵的排序问题转换成实数矩阵的排序问题。只要矩阵中的元为有界闭模糊数,就可以利用FOWA算子进行排序。最后通过算例对比分析,算例表明利用本文的方法进行排序更为简捷。     

抢占型优先服务机制下多类排队网络的扩散逼近

证明一个满负荷交通极限定理以证实在抢占型优先服务机制下多类排队网络的扩散逼近,进而为该系统提供有效的随机动力学模型．所研究的排队网络典型地出现在现代通讯系统中高速集成服务分组数据网络,其中包含分组数据包的若干交通类型,每个类型涉及若干工作处理类（步骤）,并且属于同一交通类型的工作在可能接受服务的每一个网站被赋予相同的优先权等级,更进一步地,在整个网络中,属于不同交通类型的分组数据包之间无交互路由．     

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.     

An extension of Tanner's results on uncontrolled intersections

A delay formula is developed for the problem, analyzed by Tanner in 1962, where two streams of traffic have conflicting demands at an intersection. The situation is such that the major stream has absolute priority and the minor stream vehicles can only enter the intersection when sufficiently large gaps appear in the major stream. This paper extends Tanner's work by considering a generalised stochastic structure on the arrival streams. The paper also links Tanner's work to other papers of this author where the utilitarian value of this generalised model has been established in a wide range of traffic problems.     

正互反判断矩阵元素与优先权重新的逻辑关系

揭示了一种含参数的正互反判断矩阵元素与优先权重新的逻辑关系,并对参数的含义作了解释.得出了四个重要结论.通过算例与Saaty提出的层次分析法做了比较,说明了该方法的合理、科学性.     

Sorting Using Complete Subintervals and the Maximum Number of Runs in a Randomly Evolving Sequence

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0’s, and then evolves by changing each 0 to 1, with the n changes done in random order. What is the maximal number of runs of 1’s? We give asymptotic results for the distribution and mean. It turns out that, as in many problems involving a maximum, the maximum is asymptotically normal, with fluctuations of order n ^1/2, and to the first order well approximated by the number of runs at the instance when the expectation is maximized, in this case when half the elements have changed to 1; there is also a second order term of order n ^1/3. We also treat some variations, including priority queues and sock-sorting. The proofs use methods originally developed for random graphs.