Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

In this note, we consider the scheduling problem of minimizing the sum of the weighted completion times on a single machine with one non-availability interval on the machine under the non-resumable scenario. Together with a recent 2-approximation algorithm designed by Kacem [I. Kacem, Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers & Industrial Engineering 54 (2008) 401–410], this paper is the first successful attempt to develop a constant ratio approximation algorithm for this problem. We present two approaches to designing such an algorithm. Our best algorithm guarantees a worst-case performance ratio of 2+ε. © 2008 Elsevier B.V. All rights reserved.

Counter-terrorism, anti-extremism, armed conflict and human rights: using a Russian case study

This paper critically examines Russia’s compliance with human rights obligations and the rule of law in its ‘war on terror’. It seeks to draw wider parallels with respect for human rights in the framework of the fight against ‘new global terrorism’. Threats to due process, the discriminatory application of the forces of law and order specifically against perceived “non-traditional” Muslim communities, and a ratcheting up of fear of an Islamist threat can be traced following the war in Chechnya and the handling of the Dubrovka Theatre and Beslan school sieges. To what extent are there commonalities with UK complicity in the practice of extraordinary rendition, with atrocities perpetrated in Iraq and Afghanistan, and abuses in Abu Ghraib and Guantanamo? Are the impact of these reflected in domestic security policy and British minority ethnic community relations? [From the Author]