Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

Designing and pricing menus of extended warranty contracts

Extended warranties provide “piece of mind” to a consumer in that product failures which occur after the base warranty expires are rectified at little or no cost. They also provide an additional source of revenue for manufacturers or third‐party providers, such as retailers or insurance providers, and help cultivate consumer loyalty. In this article, we analyze a number of extended warranty contracts which differ in design, including restrictions on deferrals and renewals. With the use of dynamic programming, we compute the optimal strategy for a consumer with perfect information and determine the optimal pricing policy for the provider given the consumer's risk characterization. We also provide insight into when different contracts should be issued. Finally, we illustrate how profits can be dramatically increased by offering menus of warranty contracts, as opposed to stand alone contracts, with the use of integer programming. Surprisingly, risk‐taking consumers provide the greatest benefit to offering menus. These insights can help a company develop a comprehensive warranty planning strategy for given products or product lines. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Homeland Security and Intelligence: Can Oil Mix with Water in an Open Society?

The newest US Cabinet department is Homeland Security (DHS). One of the most controversial aspects in the process of developing this entity is the role of intelligence in providing information on the increasing terrorist threat. This article examines the intelligence challenges for homeland security. In doing so, it explores the problems of merging disparate cultures - law enforcement vs intelligence, civil entities vs military, federal vs state and local jurisdictions, and domestic focus vs international perspective. Given the nature of the globalized, asymmetric threat, the need for more and better intelligence sharing is obvious. Terrorists and other criminals do not respect international boundaries; in fact, they exploit them in an effort to prevent effective and timely countermeasures. This demands that robust multinational collaboration and interagency coordination be practiced.     

Suppression of enemy air defenses (SEAD) as an information duel

Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046     

The fateful phoenix: the revival of Al-Qa’ida in Iraq

Although the Islamic State in Iraq and al-Sham (ISIS) is seen as a novel manifestation of Islamic extremism, it is in fact the latest, albeit perhaps the most effective, of a long line of revivalist movements in the Islamic and the Arab worlds. Its motivations – hisba and jihad – differ little from its predecessors and its ambitions – to create a state organised in accordance with the precepts of the Islamic caliphate – reflect a long-standing Islamic ambition. It differs, of course, in terms of the sophistication of its political and military strategies, which mirror the contemporary complexities of the world in which it operates, but its objectives recall long-standing Islamic ideals, even if articulated in radically brutal and extremist ways. More importantly, perhaps, ISIS or Da’ish, to give it its Arabic sobriquet, reflects the enormous degree of resentment inside the Middle East at the ways in which Western powers have intervened in regional affairs over recent years, particularly their support for regimes and economic systems there that have betrayed, in the popular imaginary, the essential principles of social justice that lie at the root of Islamic vision of ideal social order. Indeed, in many respects, its analysis of the world in which it operates and of the objectives it seeks differ little in essence from those any other resistance and rejectionist movement, whether religious or sectarian. More specifically, it has been the sectarian conflict that resulted from the reversal of political order in Iraq as a result of the 2003 American-led invasion that has driven the success of the movement in capturing widespread Sunni support. Whether it can manage the complexities of the administration of a state remains open to question.     

Transient behavior of large Markovian multiechelon repairable item inventory systems using a truncated state space approach

Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered.     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011