[Ocra Method: development of a new procedure for analysis of multiple tasks subject to infrequent rotation]. / Metodo Ocra: messa a punto di una nuova procedura per l'analisi di compiti multipli con rotazioni infrequenti.

ABSTRACT

In the Ocra methods (Ocra index and Ocra Checklist), when computing the final indices (Ocra index or checklist score), in the case of more than one repetitive task a "traditional" procedure was already proposed, the results of which could be defined as "time-weighted average". This approach appears to be appropriate when considering rotations among tasks that are performed very frequently, for instance almost once every hour (or for shorter periods). However, when rotation among repetitive tasks is less frequent (i.e. once every 1 1/2 or more hours), the "time-weighted average" approach could result in an underestimation of the exposure level (as it practically flattens peaks of high exposures). For those scenarios an alternative approach based on the "most stressful task as minimum" might be more realistic. This latter approach has already been included in the NIOSH approach for multiple sequential lifting tasks and, given the recent availability in the Ocra method of more detailed duration multipliers (practically one different Du(M) for each different step of one hour of duration of the repetitive task), it is now possible to define a particular procedure to compute the complex Ocra Multitask Index (cOCRA) and the complex Checklist Score (cCHESCO) for the analysis of two or more repetitive tasks when rotations are infrequent (rotations every 1 1/2 hours or more). The result of this approach will be at least equal to the index of the most stressful task considered for its individual daily duration and at the most equal to the index of the most stressful task when it is (only theoretically) considered as lasting for the overall daily duration of all examined repetitive tasks. The procedure is based on the following formula Complex Ocra Multitask Index = Ocra(1(Dum1) + (Delta ocra1xK) where 1,2,3,...,N = repetitive tasks ordered by ocra index values (1 = highest; N = lowest) computed considering respective real duration multipliers (Dum(i)). ocra1 = ocra index of task, considering Dum(1). Dum(i) = duration multiplier for task(i) real duration. Dum(tot) = duration multiplier for total duration of all repetitive tasks. delta ocra1 = highest ocra index among N tasks considering Dum(tot) (ocra(i max)) - ocra index of task1 considering Dum1. K = (ocra(1 max)*FT1) + (ocra(2 max)*FT2) + ... + (ocra (N)*FT(N)) over (ocra(i max)). ocral,Nm(1,N MAX) = index of tasks 1 to Ncons idering Dum,, (tot)7=Fr(i) c tion of Time (values from 0 to 1) of task; wi(i)h respect to the total repetitive time.