Estimation in single server queues

Moment and maximum likelihood estimates (m.l.e.'s) arc investigated for nonparametric and parametric models for a single server queue observed over a random time horizon, namely, up to the nth departure epoch. Also. m.l.e's of the mean interarrival time and mean service time in anM/M/1 queue observed over a fixed time-interval are studied Limit distributions of these estimates are obtained Without imposing steady state assumptions on the queue-size or waiting time processes.     

A new storage reduction technique for the solution of the group problem

This paper shows that by making use of an unusual property of the decision table associated with the dynamic programming solution to the goup problem, it is possible to dispense with table storage as such, and instead overlay values for both the objective and history functions. Furthermore, this storage reduction is accomplished with no loss in computational efficiency. An algorithm is presented which makes use of this technique and incorporates various additional efficiencies. The reduction in storage achieved for problems from the literature is shown.     

Optimal state-dependent pricing policies for a class of stochastic multiunit service systems

This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed.     

Landmarks in defense literature

The Power of Personality in War. By Major General Baron Hugo von Freytag-Lorighoven, Military Service Publishing Company, Harrisburg, PA (1955)     

Design of follow‐up experiments for improving model discrimination and parameter estimation

One goal of experimentation is to identify which design parameters most significantly influence the mean performance of a system. Another goal is to obtain good parameter estimates for a response model that quantifies how the mean performance depends on influential parameters. Most experimental design techniques focus on one goal at a time. This paper proposes a new entropy‐based design criterion for follow‐up experiments that jointly identifies the important parameters and reduces the variance of parameter estimates. We simplify computations for the normal linear model by identifying an approximation that leads to a closed form solution. The criterion is applied to an example from the experimental design literature, to a known model and to a critical care facility simulation experiment. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

At war with social theory: Instrumental and communicative action in US military doctrine during the War on Terror

As US counterinsurgency campaigns draw to a close, doctrine for asymmetric warfare written during the War on Terror has come under heavy criticism. While many have argued that this shift to ‘winning hearts and minds’ is evidence that the United States is taking humanitarianism and nation-building seriously, others argue that a wide gap exists between US counterinsurgency doctrine and the protection of civilians afflicted by conflict. In this article, I show that the latter is true by comparing theories of instrumental and communicative action to US doctrine for operational design, stability operations, and counterinsurgency. I argue that these texts treat the people as an object to be manipulated for the achievement of pre-determined self-interested strategic goals rather than members of a community that jointly designs operations to fulfill shared objectives. However, US doctrine does contain communicative elements that, if prioritized, would better support humanitarian and state-building objectives otherwise subordinated in the War on Terror.     

The Effectiveness of Coercive and Persuasive Counterinsurgency Practices since 1945

Which counterinsurgency approaches are most effective in defeating insurgencies? Counterinsurgency advocates and critics have debated the effectiveness of winning hearts and minds as well as using brute force against ordinary civilians. But little scholarship has sought to systemically compare these counterinsurgency approaches among a broad range of cases. This paper seeks to remedy this gap in the literature with an empirical analysis of 47 counterinsurgency wars from 1945–2000 to evaluate the effectiveness of coercive and persuasive approaches to counterinsurgency. To do so, I use crisp-set qualitative comparative analysis (QCA), or Boolean analysis, to identify the presence or absence of six coercive and persuasive counterinsurgency practices across all cases. This method enables me to highlight how counterinsurgency victory can be produced by combinations of practices rather than a single set of practices that might be expected to be useful across cases. The results demonstrate that many combinations of coercive, persuasive, and mixed counterinsurgency practices can lead to victory. However, more persuasive combinations of practices consistently lead to counterinsurgent victory compared to others, although limited coercion against civilians is constant in all cases of counterinsurgency. These findings cast doubt on the ability of counterinsurgents to refrain from harming civilians and suggest that victory requires a mix of both positive and negative incentives for cooperation.