Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

A note on efficient sequences with respect to total flow time and number of tardy jobs

For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016     

Military expenditures,economic growth and spatial spillovers

The relationship between economic growth and military expenditure has been the subject of a large literature in defence economics. This study analyses the influence of military expenditures on economic growth in a global perspective for the time period 2000–2010 taking spatial dimension into account. The augmented Solow model is employed to investigate the defence-growth nexus using the cross-sectional data relating to 128 countries. Following a traditional regression analysis, spatial variations in the relationships are examined utilizing different spatial econometric specifications estimated by maximum likelihood. The regressions are compared with each other via likelihood ratio tests, and the spatial Durbin model is found to be the most appropriate one suggesting that the typical least-squares model is misspecified. Empirical evidence indicates that military expenditure has a positive effect on economic growth with a significant spatial dependence for the time period under consideration.     

Optimal redesign decisions through failure rate estimates

To reduce the time-to-market of newly developed systems, manufacturers increasingly adopt strategies where systems are brought to market while system field reliability is still uncertain. These systems are typically sold under performance-based contracts, which incentivizes potential customers to invest in them despite reliability uncertainty. Such contracts make the manufacturer (partly) responsible for the availability of the system. Subsequently, when field reliability is lower than anticipated, the manufacturer may choose to redesign the system to avoid high contract penalties. Redesign is a costly effort which may substantially increase field reliability. Deciding when to redesign is challenging, especially because the initial failure rate estimate by the system's engineers is refined over time as failure data accrues. We propose a model that endogenizes the failure rate updating to analyze this tactical redesign decision. We study additive and multiplicative redesigns and show that the optimal policy has a control limit structure. We benchmark our optimal policy against a static counterpart numerically, and conclude that basing redesign decisions on the updated estimate of the failure rate can substantially reduce costs.     

See the light: Optimization of put-to-light order picking systems

Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems.     

Forces of heresy versus forces of conservation: making sense of Hezb-e Islami-ye Afghanistan’s and the Taleban’s positions in the Afghan insurgency

Ethnicity and ideology are frequently used to determine whether an armed group is hostile or friendly vis-à-vis the state. By contrast, I argue that the social structure of insurgent movements holds more explanatory power for their respective positions than ethnicity or ideology. To illustrate this, I apply Pierre Bourdieu’s concept of a contest between forces of ‘conservation’ and forces of ‘heresy’ to the current Afghanistan war. I demonstrate that the social structure of the Taleban renders them prone to ‘heresy’, while the formerly second biggest insurgent group, Gulbuddin Hekmatyar’s party, has rather been an impeded force of ‘conservation.’     

Book reviews

America's Secret Power: the CIA in a Democratic Society. By Loch K. Johnson. Oxford University Press, New York (1989), ISBN 0–19–505490–3, $24.95

The Bundeswehr and Western Security. Edited by Stephen F. Szabo. Houndmills, Basingstoke, and Macmillan, London (1990), ISBN 0–333–49880–1, £45.00

Symbolic Defense: the Cultural Significance of the Strategic Defense Initiative. By Edward Tabor Linenthal. University of Illinois Press, Chicago, IL (1989), ISBN 0–252–01619‐X, $19.95

Rethinking European Security. Edited by Furio Cerutti and Rodolfo Ragionieri. Crane Russak, New York (1990), £29.00

Alternative Conventional Defense Postures in the European Theater, Vol. 1: The Military Balance and Domestic Constraints. Edited by Hans Günter Brauch and Robert Kennedy, Crane Russak, New York (1990), £32.00

The Gulf War. Edited by Hanns Maull and Otto Pick. Pinter, London (1989), ISBN 0–86187–763–2, £36.00     

Formulations for dynamic lot sizing with service levels

In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Inventory models with nonlinear shortage costs and stochastic lead times; applications of shape properties of randomly stopped counting processes

In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015