From combat to non-combat action

This paper examines the rationale and centrality of private military and security companies (PMSCs) in humanitarian assistance operations in Sudan, asking why PMSCs are involved in humanitarian assistance operations in Sudan and what the principles underlying their activities are. To answer this question, the paper draws attention to the link between humanitarian crises and PMSC interventions. Where there is no meaningful alternative intervention, undergirded by humanitarian concerns that are also profit driven, PMSCs come in to provide the needed services. The protracted and complicated internal armed conflicts in Sudan, which have lasted for over two decades, have produced as many as 4,8 million internally displaced persons (IDPs) – the single largest number in the world. The kind of humanitarian assistance operations provided by PMSCs in Sudan have become critical to the provision of much-needed services which were inadequately provided by governmental authorities at both unilateral and multilateral levels. This paper argues that the humanitarian crises in Sudan created a regime that permits humanitarian assistance operations by both state and non-state actors.     

The economic effects of international trade in armaments in the major western industrialized and developing countries†

We have used the Michigan Model of World Production and Trade to assess the impact of exports and imports of armaments (based on 1980 data) on sectoral trade and employment and other economic variables in the major Western trading countries. If the United States were to place a unilateral embargo on its arms exports and imports, we calculate that it would experience a comparatively small amount of employment displacement in the aggregate and that most of this displacement would occur in the transport equipment and electric machinery sectors. If all the major Western countries were to place a multilateral embargo on their arms trade, the sectoral effects on the United States would be similarly small. But the sectoral effects in several other industrialized and developing countries measured as a percentage of sectoral employment, would be larger, indicating potential short‐run adjustment problems in labor markets in some cases.     

Defense spending and the macroeconomy

Given Kinsella's (1990, 1991) appeal for analysis to be pursued using sub‐annual level of data, we pursue such an endeavor in this paper. We examime the effect of defence spending on real output, the unemployment rate, price level, and interest rate covering a quarterly time frame 1960:1 to 1988:1 using an unrestricted vector autoregression framework. Our results parallel the findings of Kinsella in that there appears no causal relationship in either direction between defence spending and economic performance.     

INTEGRATING NUCLEAR WEAPONS STOCKPILE MANAGEMENT AND NUCLEAR ARMS CONTROL OBJECTIVES TO ENABLE SIGNIFICANT STOCKPILE REDUCTIONS

In his 2009 Prague speech and the 2010 Nuclear Posture Review, President Barack Obama committed the United States to take concrete steps toward nuclear disarmament while maintaining a safe, secure, and effective nuclear deterrent. There is an inherent tension between these two goals that is best addressed through improved integration of nuclear weapons objectives with nuclear arms control objectives. This article reviews historical examples of the interaction between the two sets of objectives, develops a framework for analyzing opportunities for future integration, and suggests specific ideas that could benefit the nuclear weapons enterprise as it undergoes transformation and that could make the future enterprise compatible with a variety of arms control futures.     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

A stochastic optimization model for planning capacity expansion in a service industry under uncertain demand

A stochastic optimization model for capacity expansion for a service industry that incorporates uncertainty in future demand is developed. Based on a weighted set of possible demand scenarios, the model generates a recommended schedule of capacity expressions, and calculates the resulting sales under each scenario. The capacity schedule specifies the size, location, and timing of these expansions that will maximize the company's expected profit. The model includes a budget constraint on available resources. By using Lagrangian relaxation and exploiting the special nested knapsack structure in the sub-problems, an algorithm was developed for its solution. Based on the initial computational results, this algorithm appears to be more efficient than linear programming for this special problem. © 1994 John Wiley & Sons, Inc.     

Note: Pairwise rearrangements in reliability structures

Boland, Proschan, and Tong [2] used the notion of criticality of nodes in a coherent system to study the optimal component arrangement of reliability structures. They also provided a sufficient minimal cut (path) based criterion for verifying the criticality ordering of two nodes. We develop a necessary and sufficient condition for two nodes to be comparable and provide specific examples illustrating our result's applicability. As a corollary, certain optimal arrangement properties of well-known systems are derived. © 1994 John Wiley & Sons, Inc.     

Employment and utilization of engineers among defense contractors

Defense contractors retain engineers for two reasons. First, engineers work on current-period production contracts. Second, engineers conduct independent research and development (IR&D) and write bids and proposals (B&P) for future contracts. The amount of IR&D/B&P activity, however, understates the amount of effort devoted to learning that reduces the cost of future production. Even some engineers who work on current-period production may engage in learning, as a by-product of their efforts. This article develops and implements a model for estimating the volume of learning activity undertaken by four large manufacturers of military aircraft. © 1994 John Wiley & Sons, Inc.