Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Violence and the state: Lessons from Colombia

Whether or not Colombia has improved is a controversial topic. If improvement has occurred, what, if any, lessons from the Colombian model can be learned? The first lesson is that Colombia's problems were caused more by a weak state than by drugs. The second lesson is that improving state capacity requires more than just increased security. The state must also provide the basic social services that citizens require to gain and maintain their support. Additionally, government institutions need to improve their professionalism, protect human rights, and root out impunity and corruption. The alternative is to suffer from new cycles of violence as old foes are vanquished, but new ones emerge.     

Limiting survival functions of self‐similar structures

We show the existence of a unique analytic single parameter limiting survival function arising from the repeated composition of a coherent structure as the number of components tends to infinity. Examples include the repeated composition process of the bridge structure. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 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.     

Replicated batch means for steady‐state simulations

This paper studies a new steady‐state simulation output analysis method called replicated batch means in which a small number of replications are conducted and the observations in these replications are grouped into batches. This paper also introduces and compares methods for selecting the initial state of each replication. More specifically, we show that confidence intervals constructed by the replicated batch means method are valid for large batch sizes and derive expressions for the expected values and variances of the steady‐state mean and variance estimators for stationary processes and large sample sizes. We then use these expressions, analytical examples, and numerical experiments to compare the replicated batch means method with the standard batch means and multiple replications methods. The numerical results, which are obtained from an AR(1) process and a small, nearly‐decomposable Markov chain, show that the multiple replications method often gives confidence intervals with poorer coverage than the standard and replicated batch means methods and that the replicated batch means method, implemented with good choices of initialization method and number of replications, provides confidence interval coverages that range from being comparable with to being noticeably better than coverages obtained by the standard batch means method. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

RETROSPECT AND PROSPECT: TRENDS IN COST AND THEIR IMPLICATIONS FOR UK AEROSPACE

This paper, intended to stimulate debate, suggests that we are at a turning point in the history of the UK military aerospace industry. It argues that there is urgent need for a fresh vision as to how the UK military aerospace industry can both prosper and make its maximum contribution to the defence of Britain. Further, the resulting plans and policies must emphasise the robustness of defence capabilities in a future in which the only thing we can be certain is that it will be very different from the present – especially whenever defence most matters.     

ISS Recent publications

The popular adage has it that ‘prevention is better than cure’. Given the heavy and enduring costs of armed conflicts, there is no disputing the fact that making efforts to prevent them from breaking out in the first place is better than waiting until it is too late. This entails two things: conflict prevention measures and early warning systems. Anything that could be done to effectively address the root causes of a conflict before it turns violent may fit into the former, while the latter aims to identify threats to these elements so that effective conflict prevention measures can be taken. In other words, ensuring ‘human security’ is the thrust of the former, while the latter serves as a surveillance camera for any deficit in providing the different components of this ‘human security’. It is with these two important issues that this essay deals, with particular reference to West Africa.