INTRODUCTION TO SELECTION, TRAINING, AND DEVELOPMENT OF PERSONNEL

By -

INTRODUCTION

Selection, training, and development are the primary tools used to promote human performance in industrial engineering settings. In this chapter, we will review important research issues in these areas. We have elected to emphasize training over the equally important topics of selection and development, primarily because training can often have substantial impact in existing application areas. In many industrial engineering situations, staff members are already in place, and even if personnel selection is an option, it is performed by other agencies, such as the human resources department. Second, ‘‘development’’ activities often consist of training—either the construction of new training programs or the use of existing ones, or both. Consequently, in our view, training (plus judicious use of other, ancillary, performance-improvement technologies) constitutes a serious poten- tial impact area for industrial engineering situations.

Further, a major concern in the domain of selection research is the development of technologies designed to address the validity and reliability of instruments used to select personnel. (‘‘Validity’’ deals with the question of determining the extent to which an assessment technique actually measures what it purports to measure, such as intelligence, clerical skill, and mathematical aptitude. ‘‘Relia- bility’’ addresses the extent to which such an instrument measures whatever it purports to measure consistently, that is, without major score differences upon repeated applications of the instrument to the same people.) Such topics as these, while very important, are beyond the scope of this chapter.

For the same reason, we have chosen not to deal with other widely researched topics in this domain, such as recruitment of personnel, employee retention, personnel turnover, metaanalysis (sta- tistical technologies for collapsing data from multiple research programs in order to reach general- izable conclusions), and validity generalization (techniques designed to apply known measurement validities obtained in one situation to another). Readers interested in these topics may consult the many current textbooks available in these areas or an overall review article (Guion 1991). An au- thoritative reference for those involved in the methods used in selection and classification of personnel is the Standards for Educational and Psychological Testing (AERA et al. 1999).

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