摘要:

AbstractThis paper considers the problem of locating a single server on a network, relaxing the assumption that the server is always available for service, and explicitly accounting for queueing. The resulting queueing‐location model allows for an arbitrary number of priority classes. Properties of the objective function are developed and algorithms presented for obtaining the optimal location on tree and cyclic networks. Sensitivity analysis with respect to the average arrival rate of calls is investigated. A numerical example is presented to illustrate the results of this paper. The major conclusions of the paper include: (a) the optimal location need not be at a node of the network, (b) the optimal location changes as a function of the arrival rate of calls into the system, (c) the optimal location is usually different from that obtained by grouping all calls into one priority clas

ISSN:0028-3045    

DOI:10.1002/net.3230180202

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1988

数据来源: WILEY

摘要:

AbstractLinnemann (Decoupling of structured systems.Syst. Contr. Lett.1(1981) 79‐86) proved that a linear square (m‐input,m‐output) dynamic system is structurally decouplable via a linear feedback if and only if there exists an elementary i/o matching in the graph representation of that system. This note supplements the above result by presenting an efficient network flow algorithm to find such a mat

ISSN:0028-3045    

DOI:10.1002/net.3230180203

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1988

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230180204

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1988

数据来源: WILEY

摘要:

AbstractThree generalizations of broadcasting and gossiping are considered: conference broadcasting in which broadcasting is done by conference calls, partial gossiping in which every gossip must learn at leastkpieces of information, and set to set gossiping in which one subset of the members must learn all of the messages of another subset of the members.

ISSN:0028-3045    

DOI:10.1002/net.3230180205

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1988

数据来源: WILEY

摘要:

AbstractComputational complexity results for two PERT problems are presented. A project is specified by precedence relations among tasks. Task durations are independent random variables with discrete, finite ranges. The following results are obtained: (1) computing a value of the cumulative distribution function of project duration is #P‐complete, (2) computing the mean of the distribution is at least as hard, and (3) neither of the problems in (1) and (2) can be computed in time polynomial in the number of points in the range of the project duration unless P = N

ISSN:0028-3045    

DOI:10.1002/net.3230180206

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1988

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230180201

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1988

数据来源: WILEY