Evaluating Behavioral Self-Monitoring With Accuracy Training for Changing Computer Work Postures

The primary purpose of this study was to replicate and extend a study by Gravina, Austin, Schroedter, and Loewy (2008) Gravina, N., Austin, J, Schroedter, L. and Loewy, S. 2008. The effects of self-monitoring on safe postural performance. Journal of Organizational Behavior Management, 28: 238–259. [Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]. A similar self-monitoring procedure, with the addition of self-monitoring accuracy training, was implemented to increase the percentage of observations in which participants worked in neutral postures. The accuracy training required the three participants to practice self-monitoring with the experimenter at least 20 times and to meet the criteria of 90% accuracy for the last 10 monitors. Feedback was delivered after each monitor. Two postures for each of the three participants were targeted by the intervention, and all six improved with an average effect size of 4.7 (range: 3.4 to 8.2) compared to Gravina et al., in which effect sizes averaged 1.9 (range:??.1 to 3.2). In addition, participant self-monitoring was more accurate overall (77%) when compared to Gravina et al. (44%).     

Replik auf Stellungnahme zu ?Pr��fungshonorare in Deutschland �C Determinanten und Implikationen��

Responding to Merkl??s discussion the authors show that Merkl??s arguments are not convincing.     

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

We study the problems of non-preemptively scheduling and packing malleable and parallel tasks with precedence constraints to minimize the makespan. In the scheduling variant, we allow the free choice of processors; in packing, each task must be assigned to a contiguous subset. Malleable tasks can be processed on different numbers of processors with varying processing times, while parallel tasks require a fixed number of processors. For precedence constraints of bounded width, we resolve the complexity status of the problem with any number of processors and any width bound. We present an FPTAS based on Dilworth’s decomposition theorem for the NP-hard problem variants, and exact efficient algorithms for all remaining special cases. For our positive results, we do not require the otherwise common monotonous penalty assumption on the processing times of malleable tasks, whereas our hardness results hold even when assuming this restriction. We complement our results by showing that these problems are all strongly NP-hard under precedence constraints which form a tree.