摘要:

AbstractThis article extends the previous research on Markov duels (stochastic duels between weapons with Markov‐dependent fire) to situations in which the time between rounds fired by each duelist is a continuous random variable that depends on the state of combat. Three starting conditions for the duels are considered: simultaneous detection, surprise by one duelist with continuous time detection by his opponent, and surprise with discrete time detection. The amount of surprise is treated as both a constant and a random variable. An application of these models to an evaluation of armored vehicles is described. The methods used to consider a variety of engagement ranges, tactical situations, and target types (both lethal and nonlethal) are discussed. The procedure for incorporating nonduel attrition into the analysis is described and the exchange rate (the expected number of enemy targets killed per armored vehicle killed) is derive

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<243::AID-NAV3220360302>3.0.CO;2-T

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

年代:1989

数据来源: WILEY

摘要:

AbstractA general Markovian model representing several multiple‐unit redundant repairable systems is proposed and its transient behavior is studied. Specifically, for multiple‐unit reliability system the reliability and availability functions are derived in an explicit form for the transient case. The stationary availability and mean time to system failure are deduced from the main results as special ca

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<255::AID-NAV3220360303>3.0.CO;2-L

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

年代:1989

数据来源: WILEY

摘要:

AbstractThe machine‐repairman problem with heterogeneous machines and multiple repairmen is considered. It is assumed that machine up times and repair times have general distributions, and a work‐conserving service discipline is employed. Under these general assumptions, steady‐state relationships between performance measures are examined for the individual machines. Also, various performance measures are defined for the aggregate system and interrelationships between these measures are establ

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<265::AID-NAV3220360304>3.0.CO;2-F

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

年代:1989

数据来源: WILEY

摘要:

AbstractThis article deals with special cases of open‐shop scheduling wherenjobs have to be processed bym, m⩾3, machines to minimize the schedule length. The main result obtained is anO(n)algorithm for the three‐machine problem with a dominated ma

ISSN:0894-069X    

DOI:10.1002/nav.3220360305

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

年代:1989

数据来源: WILEY

摘要:

AbstractThe Benders decomposition method has been successfully applied to a classic multistage, multiproduct distribution‐system design problem with fixed and linear variable costs. In other applications, however, distribution‐center variable throughput costs often show nonlinearity due to economies of scale. This article extends the standard problem formulation to a nonlinear distribution‐system design problem and incorporates the generalized Benders decomposition method in an efficient solution algorithm. Approximate dual prices are generated by solving linear instead of concave subproblems. Thereafter these prices are adjusted to induce a more accurate representation of the concave cost function before they are incorporated in the Benders cuts, which are used to generate new binary solutions. The computational results are encour

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<283::AID-NAV3220360306>3.0.CO;2-5

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

年代:1989

数据来源: WILEY

摘要:

AbstractLetp(⩾0.5) denote the probability that teamAbeatsBin a single game. The series continues until eitherAorBwinsngames. Assuming that these games are independent replications, we study some features of the distribution ofXn, the number of games played in the series. It is shown thatXnis unimodal, has an IFRA distribution, and is stochastically decreasing inp. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum‐likelihood estimator ofpbased onXnis uni

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<297::AID-NAV3220360307>3.0.CO;2-W

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

年代:1989

数据来源: WILEY

摘要:

AbstractThis article is concerned with the minimization of the maximal value of a set of linear functions subject to linear constraints. It is well known that this problem can be transformed into a standard linear programming problem by introducing an additional variable. In case index sets of nonzero coefficients of the variables contained in each function are mutually exclusive, the constraints of the associated LP problem exhibit the almost‐GUB structure. We devised a technique which reduces the number of arithmetic operations by exploiting this special structure. Computational results are also presented, which indicates that our method is more efficient than the ordinary revised simplex metho

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<311::AID-NAV3220360308>3.0.CO;2-L

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

年代:1989

数据来源: WILEY

摘要:

AbstractThis article presents an extension of the interactive multicriteria linear‐programming method of Zionts and Wallenius [seeManagement Science,29(5) (1983)]. The decision maker's underlying utility function is assumed to be pseudoconcave, and his preference structure is assessed through pairwise comparison questions. In the method of Zionts and Wallenius, the decision maker's preference structure is represented as constraints on the weights on the objectives derived from his responses. This representation is only a linear approximation to the underlying nonlinear utility function. Accordingly, inconsistency among the constraints on the weights arises while solving the problem. Therefore, some of the constraints have to be dropped, resulting in a loss of information on the preference structure, and hence an increase in the total number of questions. In this article we develop a hybrid representation scheme to avoid this problem. The proposed scheme is implemented within the algorithmic framework of the method of Zionts and Wallenius, and its underlying theory is developed. Computational results show that the number of questions required by the Zionts and Wallenius method can be sinificantly reduced using the proposed schem

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<321::AID-NAV3220360309>3.0.CO;2-F

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

年代:1989

数据来源: WILEY

摘要:

AbstractStatistical quality control of complicated production processes subject to a multiplicity of assignable causes may require the utilization of control charts with multiple control limits. This article presents an approximate semieconomic design of such charts, which is easily implementable in practical situations. Evaluations of the semieconomic control chart design show that the proposed approximate method results in solutions that are very close to the true optima and can be obtained with minimal computational effort.

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<337::AID-NAV3220360310>3.0.CO;2-W

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

年代:1989

数据来源: WILEY

ISSN:0894-069X    

DOI:10.1002/1520-6750(198906)36:3<::AID-NAV3220360301>3.0.CO;2-3

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

年代:1989

数据来源: WILEY