Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Applying Lanchester's linear law to model the Ardennes campaign

In modern warfare, many believe the decisive factor in winning a battle is seizing the right moment to shift from defense to attack, or vice versa. This paper attempts to bring that perspective to Lanchester's differential equations of warfare, and continues the application of Lanchester's linear law to the analysis of the World War II battle of Ardennes, as reported in earlier issues of Naval Research Logistics by Bracken and by Fricker. A new variable, shift time, accounting for the timing of the shift between defense and attack is explicitly included in our version of the model, and it helps obtain improved goodness of fit to historical data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:653–661, 2001     

The equivalence of general set-covering and implicit integer programming formulations for shift scheduling

In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (P1) [11, 13]. We postulated that the absence of extraordinary overlap (EO) was a requirement for the equivalence of P1 and P2. We have defined EO as the condition in which the earliest and latest starts for a break in one shift are earlier and later than the earliest and latest starts for a break in any other shift(s). In this article, we prove that our earlier postulate was accurate. Additionally, we discuss research extensions and note other scheduling problems for which implicit modeling may be appropriate. © 1996 John Wiley & Sons, Inc.     

Restricted planar location problems and applications

Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real-world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities. © 1995 John Wiley & Sons, Inc.     

Military autonomy: its origins,limits, and the politico-military dialectic of war

Military officers often oppose political interference in the conduct of war. Political leaders respond by citing Clausewitz’s contention that “war is the continuation of politics with the addition of other means.” Scholarship in security studies and civil-military relations argues that civilians are right to oppose military autonomy because it serves the parochial interests of the military. However, through the dialectical relationship between the violent essence of war and its political nature, Clausewitz provides an alternative explanation for military demands for autonomy. He shows that military and political leaders are prone to an incomplete understanding of war that can undermine strategy and policy.     

A stochastic air combat logistics decision model for Blue versus Red opposition

Technologically advanced aircraft rely on robust and responsive logistics systems to ensure a high state of operational readiness. This paper fills a critical gap in the literature for combat models by closely relating effectiveness of the logistics system to determinants of success in combat. We present a stochastic diffusion model of an aerial battle between Blue and Red forces. The number of aircraft of Blue forces aloft and ready to be aloft on combat missions is limited by the maximum number of assigned aircraft, the reliability of aircraft subsystems, and the logistic system's ability to repair and replenish those subsystems. Our parsimonious model can illustrate important trade‐offs between logistics decision variables and operational success.