Firefighter mortality studies that used standardized mortality ratio (SMR) as a summary measure are reviewed and an overview of time-dependent mortality effects for all causes, CAD, cancer, and respiratory deaths is provided. Of 17 studies reporting SMRs for firefighters, three overlapped with larger studies and six did not contain time-dependent data, leaving eight for inclusion. The time effe...

The Firefighter Problem was introduced by Bert Hartnell in 1995 at the 25th Manitoba Conference on Combinatorial Mathematics and Computing [23]. Imagine that, at time 0, a fire breaks out at a vertex of a graph G. At each subsequent time, the firefighter “defends” a vertex of G and then the fire spreads from each “burning” vertex to all of its undefended neighbours. Once a vertex is burning or ...

OBJECTIVE To assess California firefighters' blood concentrations of selected chemicals and compare with a representative US population. METHODS We report laboratory methods and analytic results for cadmium, lead, mercury, and manganese in whole blood and 12 serum perfluorinated chemicals in a sample of 101 Southern California firefighters. RESULTS Firefighters' blood metal concentrations w...

Dynamic Mechanism Design for Online Commerce Jérémle Gallien An Optimal Lot-Sizing and Offline Inspection Policy in the Case of Nonrigid Demaild Shoshana Anily and Abraham Grosfe(d-Nir Inventory Policies in a Decentralized Assembly System Fernando Bernstein and Gregory A. DeCroix Effective Heuristics for Multiproduct Partial Shipment Models Milind Dawande, Srinagesh Gavirneni, and Sridhar Tayur...

In the firefighter problem on trees, we are given a tree G = (V,E) together with a vertex s ∈ V where the fire starts spreading. At each time step, the firefighters can pick one vertex while the fire spreads from burning vertices to all their neighbors that have not been picked. The process stops when the fire can no longer spread. The objective is to find a strategy that maximizes the total nu...

Crews operating remotely piloted aircrafts (RPAs) in military operations may be among the few that truly experience tragic dilemmas similar to famous Trolley Problem. In order analyze decision-making and emotional conflict of RPA operators within Trolley-Problem-like dilemma situations, we created an simulation varied mission contexts (firefighter, surveillance as a control condition) social “v...

We consider the complexity of the firefighter problem where a budget of b ≥ 1 firefighters are available at each time step. This problem is proved to be NP-complete even on trees of degree at most three and b = 1 [10] and on trees of bounded degree b+3 for any fixed b ≥ 2 [3]. In this paper, we provide further insight into the complexity landscape of the problem by showing a complexity dichotom...