Determining a threshold control policy for an imperfect production system with rework jobs

Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999     

Comparison between constant‐stress and step‐stress accelerated life tests under Time Constraint

By running life tests at higher stress levels than normal operating conditions, accelerated life testing (ALT) quickly yields information on the lifetime distribution of a test unit. The lifetime at the design stress is then estimated through extrapolation using a regression model. In constant‐stress testing, a unit is tested at a fixed stress level until failure or the termination time point of test, whereas step‐stress testing allows the experimenter to gradually increase the stress levels at some prefixed time points during the test. In this work, the optimal k‐level constant‐stress and step‐stress ALTs are compared for the exponential failure data under complete sampling and Type‐I censoring. The objective is to quantify the advantage of using the step‐stress testing relative to the constant‐stress one. Assuming a log‐linear life–stress relationship with the cumulative exposure model for the effect of changing stress in step‐stress testing, the optimal design points are determined under C/D/A‐optimality criteria. The efficiency of step‐stress testing to constant‐stress one is then discussed in terms of the ratio of optimal objective functions based on the information matrix. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

Production-allocation scheduling and capacity expansion using network flows under uncertainty

This paper extends Connors and Zangwill's work in network flows under uncertainty to the convex costs case. In this paper the extended network flow under uncertainty algorithm is applied to compute N-period production and delivery schedules of a single commodity in a two-echelon production-inventory system with convex costs and low demand items. Given an initial production capacity for N periods, the optimal production and delivery schedules for the entire N periods are characterized by the flows through paths of minimal expected discounted cost in the network As a by-product of this algorithm the multi-period stochastic version of the parametric budget problem for the two-echelon production-inventory system is solved.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

An optimum t-test for the scale parameter of an extreme-value distribution

A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H₁: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study.     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

美军作战试验与鉴定发展研究

当前,军队装备试验鉴定正由性能试验向作战试验、在役考核全领域拓展。在装备试验鉴定体系全面重塑的历史背景下,为适应军队装备试验鉴定发展新变化,探索装备试验鉴定新理论,推进装备试验鉴定自主创新发展,亟需开展装备试验鉴定技术研究。美军相对较早开展了装备试验与鉴定工作,在作战试验与鉴定工作方面已形成了较完善的法规制度体系和规范的操作流程,有较成熟的理论与方法成果可供借鉴。与此同时,美军作战试验与鉴定工作也面临许多新问题。本文剖析了美军作战试验与鉴定的内涵和管理模式,研究了2018和2019年美军作战试验与鉴定的重点技术领域,并进行了对比分析,以期掌握近期美军作战试验与鉴定工作的发展变化。     

Testing goodness of fit to the increasing failure rate family

One branch of the reliability literature is concerned with devising statistical procedures with various nonparametric “restricted family” model assumptions because of the potential improved operating characteristics of such procedures over totally nonparametric ones. In the single-sample problem with unknown increasing failure rate (IFR) distribution F, (1) maximum-likelihood estimators of F have been calculated, (2) upper or lower tolerance limits for F have been determined, and (3) tests of the null hypothesis that F is exponential have been constructed. Barlow and Campo proposed graphical methods for assessing goodness of fit to the IFR model when the validity of this assumption is unknown. This article proposes several analytic tests of the IFR null hypothesis based on the maximum distance and area between the cumulative hazard function and its greatest convex minorant (GCM), and the maximum distance and area between the total time on test statistic and its GCM. A table of critical points is provided to implement a specific test having good overall power properties.     

A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks

This paper presents an efficient algorithm for scheduling a single-category work force on 4-day or 3-day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch on 4-day work weeks and no more than 4 days in a work stretch on 3-day work weeks. Such conditions often prevail in 7-day-a-week organizations such as hospitals, manufacturing plants, and retail stores. We determine the minimum number of workers required to satisfy the scheduling constraints under any pattern of daily requirements. Then we present the algorithm for assigning days off for each worker, thereby determining the work schedules. We show that the algorithm, by construction, will necessarily satisfy the scheduling constraints. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 839–853, 1998     

Stochastic models for spread of motivating information

In this work we consider spread of information which motivates the hearer to perform some specified action. The time to completion of an action is assumed to be a random variable and the main focus is on the number of completed actions by time t, X(t). Some models, which reflect different degree of centralization in the spread process, are analyzed and the distribution of X(t), as well as that of some other stochastic processes of interest, are obtained. The relevance to propagation of epidemics is pointed out. All models are solved by employing two interrelated concepts, namely, the order statistics property of stochastic processes and the binomial closure property of collections of distributions. In this respect, the work also serves as an illustration of the application of these useful concepts.     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.     

Test for the extreme value and weibull distributions based on normalized spacings

Discussed in this article are tests for the extreme-value distribution, or, equivalently, for the two-parameter Weibull distribution when parameters are unknown and the sample may be censored. The three tests investigated are based on the median, the mean, and the Anderson-Darling A² statistic calculated from a set zⁱ of values derived from the spacings of the sample. The median and the mean have previously been discussed by Mann, Scheuer, and Fertig [10] and by Tiku and Singh [14]. Asymptotic distributions and points are given for the test statistics, based on recently developed theory, and power studies are conducted to compare them with each other and with two other statistics suitable for the test. Of the normalized spacings tests, A² is recommended overall; the mean also gives good power in many situations, but can be nonconsistent.     

The fertile ground of Hell’s carnival: Charles T. R. Bohannan and the US Army’s Counter Intelligence Corps’ investigations of war criminals,collaborators, and the Huk,in the Philippines 1945–1947

Insurgencies thrive in regions where government legitimacy is absent. In the post-war Philippines, Captain Charles T. R. Bohannan of the Army’s Counter Intelligence Corps became actively aware of this dynamic. Bohannan is best known for his later work with Edward Lansdale and Ramon Magsaysay in defeating the Huk Rebellion (1950–1954). Here the author examines Bohannan’s early investigative work against Japanese war criminals, wartime Filipino collaborators, and the rising threat of communist subversion most associated with the Huk. All of these experiences fed into what would be the successful campaign against the Huk, chronicled in his seminal work, Counter Guerrilla Operations: The Philippines Experience, and offers lessons on the investigative (as opposed to tactical or psychological) nature of effective counter-insurgency work, as it relates to both legitimacy in governance and the rise of insurgencies.     

An extension of the (szwarc) truck assignment problem

In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p². This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p². Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity.     

The continuous multiple-modular design problem

In this article we extend our previous work on the continuous single-module design problem to the multiple-module case. It is assumed that there is a fixed cost associated with each additional module used. The Kuhn–Tucker conditions characterize local optima among which there is a global optimum. Modules are associated with partitions and a special class, guillotine partitions, are characterized. Branch-and-bound, partial enumeration, and heuristic procedures for finding optimum or good guillotine partitions are discussed and illustrated with examples.     

Ballistic impact properties of woven bamboo- woven E-glass- unsaturated polyester hybrid composites

In this study, a laminated woven bamboo/woven E glass/unsaturated polyester composite is developed to combat a ballistic impact from bullet under shooting test. The aim of this study is to understand the fundamental effects of the woven bamboo arrangement towards increasing ballistic resistance properties. The work focusses on the ballistic limit test known as NIJ V50, which qualifies materials to be registered for use in combat armor panels. The results show that the composites withstood 482.5 m/s ± 5 limit of bullet velocity, satisfying the NIJ test at level II. The findings give a strong sound basis decision to engineers whether or not green composites are qualified to replace synthetic composites in certain engineering applications.     

Statistical analysis of exponential lifetimes under an adaptive Type‐II progressive censoring scheme

In this article, a mixture of Type‐I censoring and Type‐II progressive censoring schemes, called an adaptive Type‐II progressive censoring scheme, is introduced for life testing or reliability experiments. For this censoring scheme, the effective sample size m is fixed in advance, and the progressive censoring scheme is provided but the number of items progressively removed from the experiment upon failure may change during the experiment. If the experimental time exceeds a prefixed time T but the number of observed failures does not reach m, we terminate the experiment as soon as possible by adjusting the number of items progressively removed from the experiment upon failure. Computational formulae for the expected total test time are provided. Point and interval estimation of the failure rate for exponentially distributed failure times are discussed for this censoring scheme. The various methods are compared using Monte Carlo simulation. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

What-If at Waterloo. Carl von Clausewitz’s use of historical counterfactuals in his history of the Campaign of 1815

In this article, I analyze the use of historical counterfactuals in the Campaign of 1815 by Carl von Clausewitz (1780–1831). Such is the importance of counterfactuals in this work that its gist can be given in a series of 25 counterfactuals. I claim that a central role is played by evaluative counterfactuals. This specific form of counterfactuals is part of a didactic method that allows Clausewitz to teach young officers a critical method that prepares them for the challenge of decision-making in real warfare. I conclude with the enduring relevance of Clausewitz’s use of evaluative counterfactuals for contemporary military historiography.