objectives: because of the high rates of accidents, the construction industry has become a hazardous industry in iran and therefore paying more attention is required. this paper investigates safety management in construction companies for improving workers’ safety as one of the ergonomics aims. methods: in order to survey the safety management in construction companies a questionnaire was prepa...

management of traumatized patients after road accidents is in many countries still a serious challenge. apart from technical problems in management of car accidents, the recovery and rescue of the patients and their transport to hospital need exact planning and efficient strategy. present lecture compares the trauma management in an industrial country like germany with this in iran. present wor...

In this paper, we develop a parallel solution to solve an integrated dispatching and covering problem for emergency vehicle fleet management system. The basic sequential algorithm is a coupled Ant Colony Optimization (ACO) with Tabu Search heuristic. To speed up this algorithm, we develop a master slave ACS parallel version based on the parallel neighbourhood evaluation approach for the tabu pr...

This paper addresses the crew scheduling problem for a mass rapid transit (MRT) system. The problem is to find aminimum number of duties to cover all tasks while satisfying all the hard and soft scheduling rules. Such rules are complicated in real-world operations and difficult to follow through optimization methods alone. In this paper, we propose a constraint programming (CP)-based approach t...

The present study examined the roles of student perceptions of four aspects of school climate (friction, cohesion, competition among students, and satisfaction with classes) as moderators of the relations between effortful control and subsequent conduct problems and depressive symptoms. Participants were 488 10-to-14-year old students involved in two waves, with one year between each wave, of a...

An abstract NP-hard covering problem is presented and xed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of three parameters: n, the number of elements to be covered, k, the number of sets allowed in the covering, and d, the combinatorial dimension of the problem. The rst algorithm is deterministic and has running time O...