A special case of the 3 × n flow shop problem

Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the corresponding three machine flow shop problem. Since that time, six other special cases have been solved, two contributed by Arthanari and Mukhopadhyay [1], two by Smith, Panwalkar, and Dudek [3], and two of a different nature by Szwarc [5]. This paper contributes an extension to one of the classes described by Szwarc.     

A note on the optimal replacement time of damaged devices

Abdel Hameed and Shimi [1] in a recent paper considered a shock model with additive damage. This note generalizes the work of Abdel Hameed and Shimi by showing that the a-priori restriction to replacement at a shock time made in [1] is unnecessary.     

A generalized model for the economic design of x̄control charts for production systems with increasing failure rate and early replacement

This article generalizes the model for the economic design of x̄-control charts of Duncan [4], starting from the more recent papers of Lorenzen and Vance [8] and Banerjee and Rahim [3]. The classical model of Duncan [4] and its several extensions including the unified model of Lorenzen and Vance [8] assumed exponentially distributed in-control periods and provided uniform sampling schemes. Banerjee and Rahim [3], however, assumed a Weibull-distributed in-control period having an increasing failure rate and used variable sampling intervals. The present article is an extension of the work of Banerjee and Rahim [3], where a general distribution of in-control periods having an increasing failure rate is assumed and the possibility of age-dependent repair before failure is considered. Several different truncated and nontruncated probability models are chosen. It is proposed that economic benefits can be achieved by adopting a nonuniform inspection scheme and by truncating a production cycle when it attains a certain age. Numerical examples are presented to support this proposition. Finally, the effect of model specification in the choice of failure mechanism is investigated. © 1993 John Wiley & Sons, Inc.     

电抗元件网络的优化设计方法

以信息与编码技术为主要理论依据,应用微计算机技术,提出了电抗元件网络的优化设计方法:采用二进制编码对网络进行控制,以网络分辩率δ与2~((?))的乘积δ·2~((?))作为权电阻的阻值。对该种网络的有关特性作了分析。     

Toward a study of bidding processes part IV - games with unknown costs

This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric.     

A note on a paper by houston and huffman

This paper calls attention to an experimental design which enhances the efficiency of the technique described by B. F. Houston and R. A. Huffman [3]. This alternative design is a modification of the simplex lattice design developed by Scheffé [6] for the mixture problem. While not possessing the optimal statistical properties of the central composite design proposed in [3], such as minimum bias and minimum variance, this modified design is optimum with respect to the number of design points employed; hence, it is the minimum cost design. Further, the design proposed in this note is excellent for use in multiple-block experimentation, which is very often required with constrained systems.     

模2n加与模2加相对结合律相容程度的分析

模2n加和模2加是密码算法设计中经常使用的两个编码环节,二者对于结合律的相容程度是指改变二者形成的混合等式中两个变量的运算顺序所造成的误差大小.本文研究了模2n加与模2加相对于结合律的相容程度,给出了在改变[(χ(+)y)+z]mod 2n的运算顺序时,产生的噪声函数ξ(x,y,z)=[(x(+)y)+nz](+)[x(+)(y+nz)]在各点取值的概率分布规律,以及对噪声函数所有取值点的概率值平方求和的计算公式.这些结论在区分攻击中有一定的应用价值.     

Strategic defense and attack for series and parallel reliability systems: reply 1 to comment 1

Kovenock and Roberson's [2011] comment provides initial work which has the potential, when suitably extended, to advance the research frontier. Kovenock and Roberson's paper consists of three sections. The first section is an interesting introduction. The second section, titled ‘Model and Main Result,’ provides no contribution beyond Hausken [2008a]. It consists of Equations (1)–(10) which are equivalent to equations developed by Hausken, and Equation (11) which is equivalent to the utility requirements u???0 and U???0 provided after Equation (17) in Hausken. The third section provides interesting ideas about mixed-strategy equilibria that can be extended in future research.     

A novel gradient approach for optimal design and sensitivity analysis of EWMA control charts

Conventional control charts are often designed to optimize out‐of‐control average run length (ARL), while constraining in‐control ARL to a desired value. The widely employed grid search approach in statistical process control (SPC) is time‐consuming with unsatisfactory accuracy. Although the simulation‐based ARL gradient estimators proposed by Fu and Hu [Manag Sci 45 (1999), 395–413] can alleviate this issue, it still requires a large number of simulation runs to significantly reduce the variance of gradient estimators. This article proposes a novel ARL gradient estimation approach based on integral equation for efficient analysis and design of control charts. Although this article compares with the results of Fu and Hu [Manag Sci 45 (1999), 395–413] based on the exponentially weighted moving average (EWMA) control chart, the proposed approach has wide applicability as it can generally fit into any control chart with Markovian property under any distributions. It is shown that the proposed method is able to provide a fast, accurate, and easy‐to‐implement algorithm for the design and analysis of EWMA charts, as compared to the simulation‐based gradient estimation method. Moreover, the proposed gradient estimation method facilitates the computation of high‐order derivatives that are valuable in sensitivity analysis. The code is written in Matlab, which is available on request. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 223–237, 2014     

A replacement schedule for multicomponent life-limited parts

In previous papers [1], [2] the authors developed a maintenance policy for a single life-limited part. Using an opportunistic replacement approach a scheme was devised which utilized early replacement of equipment to offset more costly future expenditures. This paper will extend the results to the multicomponent case. Examples are given illustrating the benefits of this new technique.     

Forging the Anglo‐American global defence partnership: Harold Wilson,Lyndon Johnson and the Washington summit,December 1964

This article investigates the initial phase of the relationship between the Harold Wilson government and the Lyndon Johnson administration. Despite the generally held view that relations between these two countries were neither warm or close or that Wilson was more anxious to establish a close partnership with the United States than Johnson was with Britain, the article will show that this view is rather superficial. On the contrary, it was the Johnson administration which lacked confidence in dealing with the Wilson government for several reasons. The British leadership fought its corner very well, and used Britain's ability to play a world role as a means of influencing the USA. Indeed, no other single Western ally was equal to the USA, and thus a close relationship with the USA did not necessarily mean that the other country had to have equal power and strength to the USA.     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

An efficient heuristic procedure for the capacitated warehouse location problem

This paper introduces an efficient heuristic procedure for solving a special class of mixed integer programming problem called the capacitated warehouse (plant) location problem. This procedure parallels the work reported earlier in [9] on the uncapacitated warehouse location problem. The procedure can be viewed as tracing a judiciously selected path of the branch and bound tree (from the initial node to the terminal node) to arrive at a candidate solution. A simple backtracking scheme is also incorporated in the procedure to investigate possible improvement in the solution. Computational results on problems found in the literature look quite encouraging.     

On the optimality of the bayes prediction policy in two-echelon multistation inventory models

The present paper provides a proof that the Bayes prediction ordering policy developed in [3] is an optimal policy, in the sense that it minimizes the total expected discounted cost of ordering for any finite planning horizon.     

Bayes adaptive control of two-echelon inventory systems,II: The multistation case

The present paper extends the results of [7] to cases of multistation lower echelon. For this purpose an algorithm for the optimal allocation of the upper echelon stock among the lower echelon stations is developed. The policy of ordering for the upper echelon is an extension of the Bayes prediction policy developed in [7]. Explicit formulae are presented for the execution of this policy. Several simulation runs are presented and analyzed for the purpose of obtaining information on the behavior of the system, under the above control policy, over short and long periods.     

A note on allocating jobs to two machines

A recent article in this journal by Mehta, Chandrasekaran, and Emmons [1] described a dynamic programming algorithm for assigning jobs to two identical parallel processors in a way that minimizes the average delay of these jobs. Their problem has a constraint on the sequence of the jobs such that any group of jobs assigned to a processor must be processed in the order of the sequence. This note has two purposes. First, we wish to point out a relationship between this work and some prior work [2]. Second, we wish to point out that Mehta, Chandrasekaran, and Emmons formulation, slightly generalized, can be used to find the optimum assignment of jobs to two machines in a more general class of problems than they considered including a subclass in which the jobs are not constrained to be processed in a given sequence.     

An approximate planning model for distributed computing networks

We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

On a ruckle problem in discrete games of ambush

The following zero-sum game is considered. Red chooses in integer interval [1, n] two integer intervals consisting of k and m points where k + m < n, and Blue chooses an integer point in [1, n]. The payoff to Red equals 1 if the point chosen by Blue is at least in one of the intervals chosen by Red, and 0 otherwise. This work complements the results obtained by Ruckle, Baston and Bostock, and Lee. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 353–364, 1997     

船用反应堆堆芯稳态热工水力分析程序的研制

针对船用反应堆的实际特点,在充分研究欠热沸腾传热的基础上,建立堆芯热工水力模型,研制了船用堆芯稳态热工水力分析程序.程序可用于分析船用反应堆正常工况和某些事故工况下的堆芯热工水力特性.