Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Remotely Piloted Aircraft,Risk, and Killing as Sacrifice: The Cost of Remote Warfare

In this paper I argue that a remotely piloted aircraft (RPA) pilot’s act of killing remotely, when it is done in the defense of another person, can be viewed as an act of sacrifice. This argument concludes from two premises. First, the RPA pilot faces psychological risk to self by carrying out such an action; second, the RPA pilot is motivated to some significant degree by something other than self-interest. Moreover, I challenge both the view that RPA represent merely an incremental development in technology yielding an incremental expansion of the distance between the war-fighter and the target and the view that RPA is revolutionary in some fundamental sense. I instead argue that, based upon the natural geometric boundary imposed by the earth’s shape, RPA have maximized the physical distance between the war-fighter and the target and, over time, this fact will change, not only the psychological effects on the RPA pilot, but also the way we view killing and distance in general. When taken together, these two broad claims, that other-defense can justify killing in war and that there is a psychological cost paid by remote killers, yield a conception of remote killing as an act of sacrifice that will inform the broader conversation about ethics, risk, killing, and RPA.     

Indian Military Modernization and Conventional Deterrence in South Asia

In recent years, headline grabbing increases in the Indian defense budget have raised concerns that India’s on-going military modernization threatens to upset the delicate conventional military balance vis-à-vis Pakistan. Such an eventuality is taken as justification for Islamabad’s pursuit of tactical-nuclear weapons and other actions that have worrisome implications for strategic stability on the subcontinent. This article examines the prospects for Pakistan’s conventional deterrence in the near to medium term, and concludes that it is much better than the pessimists allege. A host of factors, including terrain, the favorable deployment of Pakistani forces, and a lack of strategic surprise in the most likely conflict scenarios, will mitigate whatever advantages India may be gaining through military modernization. Despite a growing technological edge in some areas, Indian policymakers cannot be confident that even a limited resort to military force would achieve a rapid result, which is an essential pre-condition for deterrence failure.     

Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Optimal machine capacity expansions with nested limitations under stochastic demand

This paper studies capacity expansions for a production facility that faces uncertain customer demand for a single product family. The capacity of the facility is modeled in three tiers, as follows. The first tier consists of a set of upper bounds on production that correspond to different resource types (e.g., machine types, categories of manpower, etc.). These upper bounds are augmented in increments of fixed size (e.g., by purchasing machines of standard types). There is a second‐tier resource that constrains the first‐tier bounds (e.g., clean room floor space). The third‐tier resource bounds the availability of the second‐tier resource (e.g., the total floor space enclosed by the building, land, etc.). The second and third‐tier resources are expanded at various times in various amounts. The cost of capacity expansion at each tier has both fixed and proportional elements. The lost sales cost is used as a measure for the level of customer service. The paper presents a polynomial time algorithm (FIFEX) to minimize the total cost by computing optimal expansion times and amounts for all three types of capacity jointly. It accommodates positive lead times for each type. Demand is assumed to be nondecreasing in a “weak” sense. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Suppression of enemy air defenses (SEAD) as an information duel

Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046     

Managerial inventory formulations with stockout objectives and fiscal constraints

Most inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results.     

Inference from accelerated life tests using eyring type re-parameterizations

Least squares estimators of the parameters of the generalized Eyring Model are obtained by using data from censored life tests conducted at several accelerated environments. These estimators are obtained after establishing that the Gauss-Markov conditions for least squares estimation are satisfied. Confidence intervals for the hazard rate at use conditions are obtained after empirically showing that the logarithm of the estimate of the hazard rate at use conditions is approximately normally distributed. The coverage probabilities of the confidence intervals are also verified by a Monte Carlo experiment. The techniques are illustrated by an application to some real data.     

On max-min problems

Necessary and sufficient conditions for max-min problems are given here. In addition to characterization of directional derivatives of the relevant functions, subdifferentiability set for such functions is characterized.