摘要:

AbstractWe solve the problem of optimal allocation of weapons to targets in the presence of layered regional defenses. The general solution technique is an integer program transformable to a minimum‐cost network flow. This model assumes the defense has perfect weapons. Results of a small sample scenario are included. Additionally, a representative attrition algorithm is described and the two models combined to form a hybrid algorithm. The hybrid algorithm allows for less‐than‐perfect weapons while maintaining optim

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<605::AID-NAV3220340502>3.0.CO;2-L

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe flow‐shop scheduling problem with sequence‐dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two‐machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the m

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis article discusses the behavior of three continuous sampling plans: continuous sampling plan 1 (CSP 1) and continuous sampling plan 2 (CSP 2) developed by Dodge [5] and Dodge and Torrey [7], and multilevel continuous sampling plan 2 (MLP 2) developed by Lieberman and Solomon [11], when the quality of successive units in a continuous production process follows a two‐state time‐homogeneous Markov chain. We first derive the average outgoing quality (AOQ) expressions of these plans. Exact procedures for determining the average outgoing quality limit (AOQL) can be obtained only for CSP 1. For CSP 2 and MLP 2 plans, iterative procedures have been used to obtain the AOQL contours. For these plans, it is assumed that the serial correlation coefficient between the two consecutive random variables of the Markov chain is known. In addition, estimation procedures for the coefficient are given. We show that if the serial correlation coefficient of the Markov chain is positive (negative), the AOQL is increased (decreased) as compared to the case when the successive units in the production process follows a Bernoulli pattern. Letrdenote the number of production units examined in succession which are found to be of good quality andkdenote the inverse of the sampling fraction employed when quality is good. Then ifrandkare sufficiently small, it is observed from the graph that, for small departures of the serial correlation coefficient from zero, the AOQL values do not differ significantly for each of the three plans; whereas for sufficiently large values ofrandk, the AOQL values differ significantly. Various aspects of these plans, such as their operating characteristics 2 (OC 2) and the serial correlation coefficient, are discus

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<629::AID-NAV3220340504>3.0.CO;2-5

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe article considers a two‐person competitive problem in which a traveller wishes to choose a path across a rectangle from left to right in such a way as to avoid being ambushed by his adversary who has placed obstacles within the rectangle. Our results supplement those that have already been obtained by Ruckle and they indicate that, under certain conditions, the players need to adopt rather sophisticated strategies if they are to act optimally. This suggests that a complete solution to the problem could be difficul

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<645::AID-NAV3220340505>3.0.CO;2-0

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

年代:1987

数据来源: WILEY

摘要:

AbstractUsing a wide range of demand distributions and parameter settings, we examine the performance of an easily computable order‐quantity approximation for a class of continuous‐review inventory systems under a compound‐renewal demand process. The approximation is derived by using some asymptotic results from renewal theory. The emphasis is on the conditions for the accuracy of the approximation. We find that when the item is to be stocked, the approximation is practically the same as the optimal order quantity, provided that the batch‐size coefficient of variation is ≦1. Otherwise, the ratio of setup (ordering) cost to mean interarrival time must be large enough, as prescribed by a simple condition derived in the article based on empirical consi

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<655::AID-NAV3220340506>3.0.CO;2-V

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe theory of majorization is used to develop measures of information in the randomly right‐censored model when the lifetime and censoring variables are discrete. Majorization also enables us to prove some basic theorems about the measures in a simple and unified fashion. These measures include Shannon's information as a special case. The measures are inadequate in the continuous case and some alternative measures, based on the variance of the lifetime random variable, are propose

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<669::AID-NAV3220340507>3.0.CO;2-L

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe connectivity of a subgraph of a graph can exceed the connectivity of the graph. We call the largest of the connectivities of all subgraphs the subconnectivity. We then give the exact solution to the extremal problem of determining the maximum number of lines in ap‐point graph of subconnectivity tw

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I

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

年代:1987

数据来源: WILEY

摘要:

AbstractSlow‐moving items that occasionally exhibit large demand transactions are known as lumpy demand items. In modeling lumpy demand patterns, it is often assumed that the arrival of customer orders follows a Poisson process and that the order sizes are given by the geometric distribution. This gives rise to a stuttering Poisson (sP) model of lumpy demand. If lead times are constant, the result is a stuttering Poisson model of lead‐time demand. Heretofore, authors such as Ward [18] and Mitchell, Rappold, and Faulkner [12]have assumed constant lead times and thus stopped at the sP model. We develop this model further by introducing the effect of lead‐time variability. For illustration, we use the normal and the gamma distributions as characterizations of lead time. The resulting models of lead‐time demand are referred to as the geometric Poisson normal (GPN) and the geometric Poisson gamma (GPG). For both these models, the article derives tractable expressions for calculating probabilities. Errors introduced by using the sP, constant lead‐time model instead of the exact, variable lead‐time model are also

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<687::AID-NAV3220340509>3.0.CO;2-B

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

年代:1987

数据来源: WILEY

摘要:

AbstractA general assembly ofnsystems fromktypes of components is considered. The techniques of majorization and Schur function are utilized to pinpoint the optimal assembly under several criteria. Earlier results of Derman. Leiberman, and Ross [2] and El‐Neweihi, Proschan, and Sethuraman [3]are generalize

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<705::AID-NAV3220340510>3.0.CO;2-P

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe general many‐on‐one stochastic duel conditioned on the order in which targets are attacked is investigated, and the state probabilities are derived for the first time. The results are illustrated by an example of a three‐on‐one stochastic duel with negative exponential interfiring times. Some aspects of the tradeoff between individual firepower and the nominal size of a force are inves

ISSN:0894-069X    

DOI:10.1002/1520-6750(198710)34:5<713::AID-NAV3220340511>3.0.CO;2-L

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

年代:1987

数据来源: WILEY