THE SOCIAL AND PSYCHOLOGICAL IMPACT OF RADIOLOGICAL TERRORISM

The July 2005 terrorist attacks in London demonstrated the resilience of Western society in the face of low-level conventional terrorism. But the psychological damage from the London bombings would likely pale next to the severe, unpredictable, long-lasting effects of a radiological attack. One unique hazard of radiation exposure beyond the obvious physiological effects is that it is colorless, odorless, and tasteless, making it difficult for ordinary citizens to evaluate, quantify, and rationally understand the dangers confronting them. Radiological weapons stand out among the tools available to terrorists for their capacity to inflict far-reaching psychological damage to civilian populaces well beyond the immediate victims. A possible solution to mitigate the psychological consequences is to build a “resilience culture,” an interlocking set of beliefs, attitudes, approaches, and behaviors that help people fare better in any disaster or extraordinary circumstance. The “all-hazards approach,” which emphasizes the identifiable similarities among the “disaster triad”—that is, natural, accidentally man-made, and intentionally man-made disasters—extends to acts of terrorism and could help demystify the fears associated with radiological terrorist weapons.     

Project scheduling under competition

We introduce and investigate the problem of scheduling activities of a project by a firm that competes with another firm (the competitor) that has to perform the same project. The profit that the firm gets from each activity depends on whether the firm finishes the activity before or after its competitor. The objective is to maximize the guaranteed (worst‐case) profit. We assume that both the firm and the competitor can perform only one activity at a time. We perform a detailed complexity analysis of the problem, and consider problems with and without precedence constraints, with and without delay of the competitor, with general and equal processing times of activities. For polynomially solvable cases (which include, for example, all the considered problems without delay of the competitor), we present easily implementable and intuitive rules that allow us to obtain optimal schedules in linear or almost linear time. For some NP‐hard cases, we present pseudopolynomial algorithms and fast heuristics with worst‐case approximation guarantees. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.