Paul F. Zantek  Scott T. Nestler 《海军后勤学研究》2009,56(3):279-292

In this article, we study the Shewhart chart of Q statistics proposed for the detection of process mean shifts in start‐up processes and short runs. Exact expressions for the run‐length distribution of this chart are derived and evaluated using an efficient computational procedure. The procedure can be considerably faster than using direct simulation. We extend our work to analyze the practice of requiring multiple signals from the chart before responding, a practice sometimes followed with Shewhart charts. The results show that waiting to receive multiple signals severely reduces the probability of quickly detecting shifts in certain cases, and therefore may be considered a risky practice. Operational guidelines for practitioners implementing the chart are discussed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009  相似文献   

    

S. zekici  R. Soyer 《海军后勤学研究》2001,48(8):747-763

We consider a software reliability model where the failure rate of each fault depends on the specific operation performed. The software is tested in a given sequence of test cases for fixed durations of time to collect data on failure times. We present a Bayesian analysis of software failure data by treating the initial number of faults as a random variable. Our analysis relies on the Markov Chain Monte Carlo methods and is used for developing optimal testing strategies in an adaptive manner. Two different models involving individual and common faults are analyzed. We illustrate an implementation of our approach by using some simulated failure data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:747–763, 2001  相似文献   

    

P.S. Sheeba  Debasish Ghose 《海军后勤学研究》2008,55(6):581-591

We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   

    

Nader Ebrahimi  S.N.U.A. Kirmani  Ehsan S. Soofi 《海军后勤学研究》2011,58(6):531-545

Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   

    

Hans Kellerer  Joseph Y.‐T. Leung  Chung‐Lun Li 《海军后勤学研究》2011,58(6):546-563

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   

    

X. Cai  S. Zhou 《海军后勤学研究》1997,44(6):531-557

We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and known variances that are proportional to the means. The due dates of the jobs are random variables following a common probability distribution. The objective is to minimize the expectation of a weighted combination of the earliness penalty, the tardiness penalty, and the flow-time penalty. One of our main results is that an optimal sequence for the problem must be V-shaped with respect to the mean processing times. Other characterizations of the optimal solution are also established. Two algorithms are proposed, which can generate optimal or near-optimal solutions in pseudopolynomial time. The proposed algorithms are also extended to problems where processing times do not satisfy the assumption in the model above, and are evaluated when processing times follow different probability distributions, including general normal (without the proportional relation between variances and means), uniform, Laplace, and exponential. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 531–557, 1997.  相似文献   

    

S. N. Gupta  A. K. Jain  Kanti Swarup 《海军后勤学研究》1987,34(2):293-305

In this article is studied a stochastic linear fractional programming problem, in which the parameters of both the numerator and the denominator are assumed to be mutually independent Cauchy variates. The deterministic equivalent of the problem is obtained and is shown to be a linear fractional program. A numerical example is also added for illustration.  相似文献   

    

Stephen A. Smith  Shmuel S. Oren 《海军后勤学研究》1980,27(4):539-547

This paper considers the problem of modeling the reliability of a repairable system or device that is experiencing reliability improvement. Such a situation arises when system failure modes are gradually being corrected by a test-fix-test-fix procedure, which may include design changes. A dynamic reliability model for this process is discussed and statistical techniques are derived for estimating the model parameters and for testing the goodness-of-fit to observed data. The reliability model analyzed was first proposed as a graphical technique known as Duane plots, but can also be viewed as a nonhomogeneous Poisson process with a particular mean value function.  相似文献   

    

S. Zacks 《海军后勤学研究》1979,26(3):423-435

The present paper presents an algorithm for the exact determination of survival distributions in crossing mine fields. The model under consideration considers clusters of mines, scattered at random in the field around specified aim points. The scatter distributions of the various clusters are assumed to be known The encounter process allows for a possible detection and destruction of the mines, for inactivation of the mines and for the possibility that an activated mine will not destroy the object. Recursive formulae for the determination of the survival probabilities of each object (tank) in a column of n crossing at the same path are given. The distribution of the number of survivors out of n objects in a column is also determined. Numerical examples are given.  相似文献   

    

John S. Croucher 《海军后勤学研究》1978,25(4):729-732

This paper develops an algorithm for a “shortest route” network problem in which it is desired to find the path which yields the shortest expected distance through the network. It is assumed that if a particular arc is chosen, then there is a finite probability that an adjacent arc will be traversed instead. Backward induction is used and appropriate recursion formulae are developed. A numerical example is provided.  相似文献