Asymptotically optimal linear time algorithms for two‐stage and three‐stage flexible flow shops

We consider two‐stage and three‐stage flexible flow shops with parallel machines in each stage and the minimum makespan objective. We develop linear time algorithms for these problems with absolute worst‐case bounds either sharper or no worse than the currently available ones and we accomplish this with lower complexity algorithms. We also demonstrate the asymptotic optimality of a class of algorithms for multistage flexible flow shop problems (which includes the proposed algorithms) under certain probabilistic assumptions on the job processing times. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 259–268, 2000     

Incorporation dynamic aspects and uncertainty in 1‐median location problems

In this paper we present several 1‐median formulations on a tree network which incorporate dynamic evolution and/or uncertainty of node demands and transportation costs over a planning horizon. Dynamic evolution is modeled using linear demand functions for the nodes and linear length functions for the edges. Uncertainty is modeled with the use of multiple scenarios, where a scenario is a complete specification of the uncertain node demands and/or edge lengths. We formulate our objective using minimax regret like criteria. We use two different criteria, namely, robust deviation and relative robustness. We discuss what motivated the introduction of these objectives, as well as their relation to existing literature and decision making practices. For all of the models presented, we provide low‐order polynomial time algorithms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 147–168, 1999     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Ethnic targeting: A bad idea whose time has come

Wm. Roger Louis, Imperialism at Bay 1941–1945. The United States and the decolonization of the British Empire. Oxford: Clarendon Press, 1977. Pp. xvi + 595;£12.50.

Christopher Thorne, Allies of a Kind. The United States, Britain and the war against Japan, 1941–1945. London: Hamish Hamilton, 1978. Pp. xxii + 772; £15.00.

Michael Howard, editor, Restraints on War: Studies in the Limitation of Armed Conflict Oxford: Oxford University Press, 1979. Pp. viii + 173; £6.50.

Julian Lider, The Political and Military Laws of War: an Analysis of Marxist‐Leninist Concepts. Farnborough, Hants: Saxon House, 1979. Pp. vii + 266; £12.50.

Klaus‐Jürgen Müller and Eckardt Opitz (editors), Militär und Militarismus in der Weimarer Republik. Düsseldorf: Droste Verlag, 1978. Pp. 304; n.p.

Nicholas Bethell, The Palestine Triangle: The Struggle Between the British, the Jews and the Arabs 1935–1948. London: Steinmatsky's Agency Ltd. in association with Andre Deutsch, 1919. Pp. 384; £7.95.

Sir Maurice Dean, The Royal Air Force and Two World Wars. London: Cassell, 1979. Pp. 349; £8.95.

Wilfred Jay Holmes, Double‐Edged Secrets. Annapolis, Maryland: Naval Institute Press, 1979. Pp. 218, n.p.

S. G. Gorshkov, The Sea Power of the State. Oxford: Pergamon Press, 1979. Pp. 290; £15.00.

Kirk, Grayson and Wessell, N.H. eds., The Soviet Threat: Myths and Realities. New York and London: Praeger, 1978. Pp. 182; £12.00.

Kenneth E. Boulding, Stable Peace. Austin and London: University of Texas Press, 1978. Pp. 155;£2.80.

Kenneth E. Boulding (ed.), Peace and the War Industry. New Brunswick, NJ: Transaction Books, and Oxford: Basil Blackwell, 1973. Pp. vii + 213; £2.75.     

An Ideological Response to Combating Terrorism – The Singapore Perspective

The article examines alternative strategies to combating the scourge of terrorism beyond military approaches. There is now more realization, especially after the difficulties experienced in Iraq today, that an innovative multi-pronged mix of methods is needed to combat international terrorism. The paper looks at an ideological response towards combating terrorism by looking at the Singapore experience. The Singapore government recognizes the importance of an ideological response as an integral part of counterterrorism measures. Terrorism occurs when opportunity, motivation and capability meet. The prevention of terrorism requires the elimination of at least one of these three factors- motivation- often driven by ideology. The paper will look at direct and indirect initiatives undertaken in Singapore to combat terrorism and will also look at the Muslim community in Singapore's response to the threat to Singapore society. Lastly, the article will examine some lessons learnt from the Singapore experience in applying an ideological approach in combating terrorism as well as some recommendations of what more can be done to move forward.     

Hybrid heuristics for minimum cardinality set covering problems

Minimum cardinality set covering problems (MCSCP) tend to be more difficult to solve than weighted set covering problems because the cost or weight associated with each variable is the same. Since MCSCP is NP-complete, large problem instances are commonly solved using some form of a greedy heuristic. In this paper hybrid algorithms are developed and tested against two common forms of the greedy heuristic. Although all the algorithms tested have the same worst case bounds provided by Ho [7], empirical results for 60 large randomly generated problems indicate that one algorithm performed better than the others.