Relationship between onset-to-door time and door-to-thrombolysis time: a pooled analysis of 10 dedicated stroke centers

BACKGROUND AND PURPOSE Inverse relationship between onset-to-door time (ODT) and door-to-needle time (DNT) in stroke thrombolysis was reported from various registries. We analyzed this relationship and other determinants of DNT in dedicated stroke centers. METHODS Prospectively collected data of consecutive ischemic stroke patients from 10 centers who received IV thrombolysis within 4.5 hours from symptom onset were merged (n=7106). DNT was analyzed as a function of demographic and prehospital variables using regression analyses, and change over time was considered. RESULTS In 6348 eligible patients with known treatment delays, median DNT was 42 minutes and kept decreasing steeply every year (P<0.001). Median DNT of 55 minutes was observed in patients with ODT ≤30 minutes, whereas it declined for patients presenting within the last 30 minutes of the 3-hour time window (median, 33 minutes) and of the 4.5-hour time window (20 minutes). For ODT within the first 30 minutes of the extended time window (181-210 minutes), DNT increased to 42 minutes. DNT was stable for ODT for 30 to 150 minutes (40-45 minutes). We found a weak inverse overall correlation between ODT and DNT (R(2)=-0.12; P<0.001), but it was strong in patients treated between 3 and 4.5 hours (R(2)=-0.75; P<0.001). ODT was independently inversely associated with DNT (P<0.001) in regression analysis. Octogenarians and women tended to have longer DNT. CONCLUSIONS DNT was decreasing steeply over the last years in dedicated stroke centers; however, significant oscillations of in-hospital treatment delays occurred at both ends of the time window. This suggests that further improvements can be achieved, particularly in the elderly.

An MBLP model for scheduling assessment centers

Firms aim at assigning qualified and motivated people to jobs. Human resources managers often conduct assessment centers before making such personnel decisions. By means of an assessment center, the potential and skills of job applicants can be assessed more objectively. For the scheduling of such assessment centers, we present a formulation as a mixed-binary linear program and report on computational results for four real-life examples.

Treatment with tumor necrosis factor inhibitors in axial spondyloarthritis: comparison between private rheumatology practices and academic centers in a large observational cohort

OBJECTIVE To evaluate the initiation of and response to tumor necrosis factor (TNF) inhibitors for axial spondyloarthritis (axSpA) in private rheumatology practices versus academic centers. METHODS We compared newly initiated TNF inhibition for axSpA in 363 patients enrolled in private practices with 100 patients recruited in 6 university hospitals within the Swiss Clinical Quality Management (SCQM) cohort. RESULTS All patients had been treated with ≥ 1 nonsteroidal antiinflammatory drug and > 70% of patients had a baseline Bath Ankylosing Spondylitis Disease Activity Index (BASDAI) ≥ 4 before anti-TNF agent initiation. The proportion of patients with nonradiographic axSpA (nr-axSpA) treated with TNF inhibitors was higher in hospitals versus private practices (30.4% vs 18.7%, p = 0.02). The burden of disease as assessed by patient-reported outcomes at baseline was slightly higher in the hospital setting. Mean levels (± SD) of the Ankylosing Spondylitis Disease Activity Score were, however, virtually identical in private practices and academic centers (3.4 ± 1.0 vs 3.4 ± 0.9, p = 0.68). An Assessment of SpondyloArthritis international Society (ASAS40) response at 1 year was reached for ankylosing spondylitis in 51.7% in private practices and 52.9% in university hospitals (p = 1.0) and for nr-axSpA in 27.5% versus 25.0%, respectively (p = 1.0). CONCLUSION With the exception of a lower proportion of patients with nr-axSpA newly treated with anti-TNF agents in private practices in comparison to academic centers, adherence to ASAS treatment recommendations for TNF inhibition was equally high, and similar response rates to TNF blockers were achieved in both clinical settings.

Sexual harassment over the telephone: Occupational risk at call centers

The phenomenon of sexually harassing telephone calls in the workplace has been studied only marginally. In the present study 106 employees working in call centres in Germany answered a questionnaire regarding their experiences of sexual harassment over the telephone. The following data are presented: description of the phenomenon, i.e. prevalence and characteristics, stress reactions of the victims, behavioural reactions and coping strategies, consequences and anticipated consequences; prediction of the stress reactions by characteristics of the situation; and employees' recommendations for coping with sexually harassing calls. It was found that the female employees were more often sexually harassed over the telephone at work than their male colleagues. Three out of four female employees had experienced sexually harassing telephone calls; in the majority of cases the harassers were men. Characteristic patterns of harassment included groaning, sexual insults, silence, and threats of sexual violence. Some 16% of the harassed female employees described these experiences as extremely stressful. If the harassment contained threats of sexual violence and groaning, the perceived physical response was stronger. Being subjected to sexual harassment over the telephone both at home and at work was a more severe stress than having the experience only in the workplace. In conclusion, employees' recommendations for coping with the occurrence of sexually harassing calls are described.

Efficient list-generation techniques for scheduling assessment centers

Human resources managers often conduct assessment centers to evaluate candidates for a job position. During an assessment center, the candidates perform a series of tasks. The tasks require one or two assessors (e.g., managers or psychologists) that observe and evaluate the candidates. If an exercise is designed as a role-play, an actor is required who plays, e.g., an unhappy customer with whom the candidate has to deal with. Besides performing the tasks, each candidate has a lunch break within a prescribed time window. Each candidate should be observed by approximately half the number of the assessors; however, an assessor may not observe a candidate if they personally know each other. The planning problem consists of determining (1) resource-feasible start times of all tasks and lunch breaks and (2) a feasible assignment of assessors to candidates, such that the assessment center duration is minimized. We present a list-scheduling heuristic that generates feasible schedules for such assessment centers. We propose several novel techniques to generate the respective task lists. Our computational results indicate that our approach is capable of devising optimal or near-optimal schedules for real-world instances within short CPU time.

A heuristic approach for scheduling assessment centers

Human resources managers often use assessment centers to evaluate candidates for a job position. During an assessment center, the candidates perform a series of exercises. The exercises require one or two assessors (e.g., managers or psychologists) that observe and evaluate the candidate. If an exercise is designed as a role-play, an actor is required as well which plays, e.g., an unhappy customer with whom the candidate has to deal with. Besides performing the exercises, the candidates have a lunch break within a prescribed time window. Each candidate should be observed by approximately half the number of the assessors. Moreover, an assessor cannot be assigned to a candidate if they personally know each other. The planning problem consists of determining (1) resource-feasible start times of all exercises and lunch breaks and (2) a feasible assignment of assessors to candidates, such that the assessment center duration is minimized. We propose a list-scheduling heuristic that generates feasible schedules for such assessment centers. We develop novel procedures for devising an appropriate scheduling list and for incorporating the problem-specific constraints. Our computational results indicate that our approach is capable of devising optimal or near-optimal solutions to real-world instances within short CPU time.