摘要:

AbstractOne approach to the evaluation of the performance of multiprogranmed computer systems includes the development of Monte Carlo simulations of transitions of programs within such systems, and their strengthening by control variable and concomitant variable methods. An application of such a combination of analytical, numerical, and Monte Carlo approaches to a model of system overhead in a paging machine is presented.

ISSN:0028-1441    

DOI:10.1002/nav.3800180402

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

年代:1971

数据来源: WILEY

摘要:

AbstractModels are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time‐weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory system

ISSN:0028-1441    

DOI:10.1002/nav.3800180403

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

年代:1971

数据来源: WILEY

摘要:

AbstractThe bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum timeTwo algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationa

ISSN:0028-1441    

DOI:10.1002/nav.3800180404

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

年代:1971

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800180405

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

年代:1971

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800180406

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

年代:1971

数据来源: WILEY

摘要:

AbstractIn this paper we show that the Gomory fractional cut (hyperplane) for the integer program is either void of integer points or contains an infinite number of them. The conditions for each case are presented. Also, we derive a stronger cut from the hyperplane which does not intersect integer points.

ISSN:0028-1441    

DOI:10.1002/nav.3800180407

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

年代:1971

数据来源: WILEY

摘要:

AbstractThe most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered.

ISSN:0028-1441    

DOI:10.1002/nav.3800180408

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

年代:1971

数据来源: WILEY

摘要:

AbstractHakimi has considered the problem of finding an optimal location for a single service center, such as a hospital or a police station. He used a graph theoretic model to represent the region being serviced. The communities are represented by the nodes while the road network is represented by the ares of the graph. In his work, the objective is one of minimizing the maximum of the shortest distances between the vertices and the service center. In the present work, the region being serviced is represented by a convex polygon and communities are spread over the entire region. The objective is to minimize the maximum of Euclidian distances between the service center and any point in the polygon. Two methods of solution presented are (i) a geometric method, and (ii) a quadratic programming formulation. Of these, the geometric method is simpler and more efficient. It is seen that for a class of problems, the geometric method is well suited and very efficient while the graph theoretic method, in general, will give only approximate solutions in spite of the increased efforts involved. But, for a different class of problems, the graph theoretic approach will be more appropriate while the geometric method will provide only approximate solutions though with ease. Finally, some feasible applications of importance are outlined and a few meaningful extensions are indicated.

ISSN:0028-1441    

DOI:10.1002/nav.3800180409

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

年代:1971

数据来源: WILEY

摘要:

AbstractWe consider the scheduling ofntasks on a single resource. Each task becomes available for processing at timeai, must be completed by timebi, and requiresditime units for processing. The aim is to find a schedule that minimizes the elapsed time to complete all jobs. We present solution algorithms for this problem when job splitting is permitted and when job splitting is not permitted. Then we consider several scheduling situations which arise in practice where these models may apply.

ISSN:0028-1441    

DOI:10.1002/nav.3800180410

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

年代:1971

数据来源: WILEY

摘要:

AbstractAsymptotic representations are found for the large deviation probabilities that thenα‐th order statistic exceeds δ, where δ>α. The probabilities are first expressed in terms of the empirical distribution function, and then the 1960 theorem of Bahadur and Ranga Rao is applied. The result is then shown to be more precise than a logarithmic statement in a 1969 paper of Sievers dealing with the asymptotic relative efficiency of the sample median

ISSN:0028-1441    

DOI:10.1002/nav.3800180411

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

年代:1971

数据来源: WILEY