INTRODUCTION TO ANALYSIS, DESIGN, AND OPERATION

By -

INTRODUCTION

According to the Board of Certification in Professional Ergonomics (BCPE 21000), ergonomics is a body of knowledge about human abilities, human limitations, and other human characteristics that are relevant to design. Ergonomic design is the application of this body of knowledge to the design of tools, machines, systems, tasks, jobs, and environments for safe, comfortable, and effective human use. The underlying philosophy of ergonomics is to design work systems where job demands are within the capacities of the workforce. Ergonomic job design focuses on fitting the job to capabilities of workers by, for example, eliminating occurrence of nonnatural postures at work, reduction of excessive strength requirements, improvements in work layout, design of hand tools, or optimizing work / rest requirements (Karwowski 1992; Karwowski and Salvendy 1998; Karwowski and Marras 1999).

Ergonomics is seen today as a vital component of the value-adding activities of the company, with well-documented cost–benefit aspects of the ergonomics management programs (GAO 1997). A company must be prepared to accept a participative culture and utilize participative techniques in implementation of work design principles. The job design-related problems and consequent intervention should go beyond engineering solutions and include all aspects of business processes, including product design, engineering and manufacturing, quality management, and work organizational issues, along the side of task design or worker education and training (Karwowski and Salvendy 1999; Karwowski and Marras 1999; Genaidy et al. 1999).

This chapter deals primarily with work analysis and design, as well as related human performance on physical tasks. The information about cognitive and other human performance aspects can be found in other chapters of this Handbook.

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each
Read more

NETWORK OPTIMIZATION MODELS:THE SHORTEST-PATH PROBLEM

By -
Image
THE SHORTEST-PATH PROBLEM Although several other versions of the shortest-path problem (including some for directed networks) are mentioned at the end of the section, we shall focus on the following simple version. Consider an undi r ecte d and connected network with two special nodes called the origin and the destination. Associated with each of the links (undirected arcs) is a non- negative distance. The objective is to find the shortest path (the path with the minimum total distance) from the origin to the destination. A relatively straightforward algorithm is available for this problem. The essence of this procedure is that it fans out from the origin, successively identifying the shortest path to each of the nodes of the network in the ascending order of their (shortest) distances from the origin, thereby solving the problem when the destination node is reached. We shall first outline the method and then illustrate it by solving the shortest-path problem encountered by the See
Read more