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 explicit solution in linear fractional programming

In this note we analyze the fractional interval programming problem (FIP) and find, explicitly, all its optimal solutions. Though our results are essentially the same as those in Charnes and Cooper [4], the proofs and analysis we provide here are considerably simpler.     

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.     

Redundant spares allocation to reduce reliability costs

The problem considered here is the optimal selection of the inventory of spares for a system built from two kinds of modules, the larger of which can be connected so it performs the role of the smaller one. The optimal inventory is the least costly one which achieves a specified probability that the spares will not be exhausted over the design lifetime. For some costs and failure rates it is most economical to use the larger module for both roles, due to the resulting increase in flexibility in the deployment of a single type of spare module. Both analytical and simulation methods have been used to study this problem.     

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.     

An algorithm for solving general fractional interval programming problems

A Linear Fractional Interval Programming problem (FIP) is the problem of extremizing a linear fractional function subject to two-sided linear inequality constraints. In this paper we develop an algorithm for solving (FIP) problems. We first apply the Charnes and Cooper transformation on (FIP) and then, by exploiting the special structure of the pair of (LP) problems derived, the algorithm produces an optimal solution to (FIP) in a finite number of iterations.     

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.     

Slow failure: Understanding America’s quagmire in Afghanistan

ABSTRACT

The United States government has no organised way of thinking about war termination other than seeking decisive military victory. This implicit assumption is inducing three major errors. First, the United States tends to select military-centric strategies that have low probabilities of success. Second, the United States is slow to modify losing or ineffective strategies due to cognitive obstacles, internal frictions, and patron-client challenges with the host nation government. Finally, as the U.S. government tires of the war and elects to withdraw, bargaining asymmetries prevent successful transitions (building the host nation to win on its own) or negotiations.     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020