Optimum simple step-stress accelerated life tests for weibull distribution and type I censoring

This article presents an optimum simple step-stress accelerated life test for the Weibull distribution under Type I censoring. It is assumed that a log-linear relationship exists between the Weibull scale parameter and the (possibly transformed) stress and that a certain cumulative exposure model for the effect of changing stress holds. The optimum plan—low stress and stress change time—is obtained, which minimizes the asymptotic variance of the maximum likelihood estimator of a stated percentile at design stress. For selected values of the design parameters, nomographs useful for finding the optimum plan are given, and the effects of errors in preestimates of the parameters are investigated. As an alternative to the simple step-stress test, a three-level compromise plan is proposed, and its performance is studied and compared with that of the optimum simple step-stress test. © 1993 John Wiley & Sons. Inc.     

Economic screening procedures using a correlated variable with multidecision alternatives

Economic screening procedures using a correlated variable are developed for selecting markets in situations when there are several markets with different profit/ cost structures. It is assumed that the performance variable and the screening variable are jointly normally distributed. Profit models are constructed which involve three profit/cost components: profit from a conforming item, cost from an accepted nonconforming item, and screening inspection cost. Methods of finding the optimal screening procedures are presented and numerical examples are given.     

State information lag markov decision process with control limit rule

In the framework of a discrete Markov decision process with state information lag, this article suggests a way for selecting an optimal policy using the control limit rule. The properties sufficient for an optimal decision rule to be contained in the class of control limit rules are also studied. The degradation in expected reward from that of the perfect information process provides a measure of the potential value of improving the information system.     

The (s,Q) inventory model with Erlang lead time and deterministic demand

We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Dynamic proximity calculations for situation awareness

We apply dynamic proximity calculations (density and clustering) from dynamic computational geometry to a military application. The derived proximity information serves as an abstract view of a current situation in the battlefield that can help a military commander achieve situation awareness. We employ Delaunay triangulation as a computational tool in our framework, and study its dynamic update in depth. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Network disconnection problems in a centralized network

We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007