A parallel sequencing algorithm for minimizing total cost

The problem of sequencing jobs on parallel processors when jobs have different available times, due dates, penalty costs and waiting costs is considered. The processors are identical and are available when the earliest job becomes available and continuously thereafter. There is a processor cost during the period when the processor is available for processing jobs. The proposed algorithm finds the sequence (or sequences) with minimum total cost (sum of waiting, penalty and processor costs.). A proof of the algorithm and numerical results are given.     

State-dependent gap acceptance

This paper considers a traffic problem in which vehicles queue up according to a Poisson process on a single-lane entrance ramp prior to merging into a major stream of vehicular traffic. In order to then prevent the ramp queue from becoming too large, a model is proposed which considers a lowering of the critical gap as the ramp queue size increases. With the critical gap assumed to be a nonincreasing function of the number of vehicles on the ramp at instances that correspond to departure times of lead vehicles from the ramp queue, the resultant model is an M/G/1 queue with state-dependent service times. Some general results are obtained for this model and a specific case discussed in moderate detail.     

A markov chain version of the secretary problem

This paper deals with the Secretary Problem where n secretaries are interviewed sequentially and the best k must be hired. The values of the secretaries are observed as they are interviewed, but beforehand only the distributions of these values are known. Furthermore, the distributions of two successive secretaries' values are governed by a Markov chain. Optimal hiring policies for finite n and limiting optimal policies as k and n approach infinity are obtained.     

A note on testing for exponentiality

In this note some extensions are made to previous work by a number of authors on the development of tests for exponentiality. The most recent example is due to Fercho and Ringer in which they compare the small sample powers of a few well-known test statistics for the hypothesis of a constant failure rate. It is the primary intent of this current work to extend Gnedenko's F test to situations with hypercensoring and to provide guidance for its use, particularly when a log-normal distribution is the alternative.     

Flowshop sequencing problem with ordered processing time matrices: A general case

The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.     

The long shadow of colonial cartography: Britain and the Sino-Indian war of 1962

ABSTRACT

This article examines British responses to the Sino-Indian border war of 1962. It illustrates how, in the years leading up to the war, Britain’s colonial legacy in the Indian subcontinent saw it drawn reluctantly into a territorial dispute between Asia’s two largest and most powerful nations. It analyses disagreements in Whitehall between the Foreign Office and Commonwealth Relations Office over the relative strength of India and China’s border claims, and assesses how these debates reshaped British regional policy. It argues that the border war was instrumental in transforming Britain’s post-colonial relationship with South Asia. Continuing to filter relations with India through an imperial prism proved unsatisfactory, what followed was a more pragmatic Indo-British association.     

Capacity expansion with lead times and autocorrelated random demand

The combination of uncertain demand and lead times for installing capacity creates the risk of shortage during the lead time, which may have serious consequences for a service provider. This paper analyzes a model of capacity expansion with autocorrelated random demand and a fixed lead time for adding capacity. To provide a specified level of service, a discrete time expansion timing policy uses a forecast error‐adjusted minimum threshold level of excess capacity position to trigger an expansion. Under this timing policy, the expansion cost can be minimized by solving a deterministic dynamic program. We study the effects of demand characteristics and the lead time length on the capacity threshold. Autocorrelation acts similarly to randomness in hastening expansions but has a smaller impact, especially when lead times are short. However, the failure either to recognize autocorrelation or to accurately estimate its extent can cause substantial policy errors. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Casualty Rates of US Military Personnel During the Wars in Iraq and Afghanistan

Abstract

In Operation Iraqi Freedom, which ended in August 2010, nearly 3500 hostile deaths occurred among US military personnel and 32,000 more were wounded in action (WIA). More than 1800 hostile deaths occurred during Operation Enduring Freedom (in and around Afghanistan) through 2014 and about 20,000 were WIA. A larger proportion of wounded personnel survived in Iraq and Afghanistan than during the Vietnam War, but the increased survival rates were not as high as some studies have asserted. The survival rates were 90.2% in Iraq and 91.6% in Afghanistan, compared with 86.5% in Vietnam. The casualty rates varied between the conflicts in Iraq and Afghanistan and before, during, and after the respective surges. Amputation rates are difficult to measure consistently, but I estimate that 2.6% of all WIA and 9.0% of medically evacuated WIA from the Iraq and Afghanistan theaters combined resulted in the major loss of a limb. Elevated non-hostile death rates (including deaths due to accidents, illnesses, homicides, or suicides) resulted in about 220 more deaths in Iraq and about 200 more deaths in Afghanistan than would have been expected in peacetime among populations of the size deployed to those two conflicts.     

What is the global landpower network and what value might it provide?

US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives.     

Optimal sample size allocation for tests with multiple levels of stress with extreme value regression

In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007