INDUSTRIAL ENGINEERING APPLICATIONS IN HEALTH CARE SYSTEMS:INTRODUCTION TO INDUSTRIAL ENGINEERING IN HEALTH CARE DELIVERY SYSTEMS

By -

INTRODUCTION TO INDUSTRIAL ENGINEERING IN HEALTH CARE DELIVERY SYSTEMS

Frank Gilbreth is considered to be the first to use industrial engineering tools for methods improve- ment in a hospital situation. He applied his motion study techniques to surgical procedures in 1913 (Nock 1913); (Gilbreth 1916). In the 1940s, Lillian Gilbreth published articles explaining the benefits of using methods-improvement techniques in hospitals and in nursing (Gilbreth 1945, 1950). In 1952, a two-week workshop was conducted at the University of Connecticut on the application of methods improvement in hospitals (Smalley 1982). Also in 1952, the American Hospital Association (AHA) created a Committee on Methods Improvement. This committee prepared several papers on methods- improvement activities in hospitals and published them in its interim report in 1954.

In the late 1950s, the American Hospital Association started offering workshops on methods improvement around the country. Universities added courses on the application of methods improve- ment in hospital administration and industrial engineering programs. Gradually, other industrial en- gineering techniques were studied and applied to various hospital problems. The growing use of industrial engineering techniques in hospitals resulted in the foundation of the Hospital Management Systems Society (HMSS) in Atlanta in 1961, which subsequently moved to Chicago in 1964. The Institute of Industrial Engineers also recognized the expanding role of industrial engineering tech- niques and formed a hospital section in 1964. This section changed its name to the Health Services Division in 1977, reflecting the broader scope of the field. In 1988, the Institute of Industrial Engineers approved the formation of the Society for Health Systems (SHS) to replace the Health Services Division. In 1987, HMSS changed its name to Healthcare Information and Management Systems Society (HIMSS) to recognize the growing role of information systems in health care. Both HIMSS and SHS offer a number of seminars and workshops throughout the year related to the application of information systems and industrial engineering in health care. They also cosponsor annual HIMSS conference in February and the annual SHS conference in September / October of each year. Many of the industrial engineers working in the health care industry are members of both organizations.

Educational institutions started offering industrial engineering programs with specialization in health care systems. Many industrial engineers today work for hospitals and health systems, while others work as consultants in health care. The industrial engineers working in health care systems are usually referred as management engineers or operations analysts. Smalley (1982) gives a detailed history of the development of the use of industrial engineering in hospitals.

Industrial engineers gradually realized that many industrial engineering techniques initially applied to manufacturing / production systems were equally applicable in service systems such as health care systems. Almost all of the industrial engineering tools and techniques have been applied to health care systems. In this chapter, the application of only some of these techniques to health care systems will be discussed. From the examples presented here, readers should be able to appreciate the appli- cation of other techniques to health care systems. The application of the following techniques in health care systems is discussed here:

1. Methods improvement and work simplification

2. Staffing analysis

3. Scheduling

4. Queuing and simulation

5. Statistical analysis

6. Optimization

7. Quality improvement

8. Information systems / decision support systems

The emphasis will be on the application in health care, not on the techniques themselves, because the details of industrial engineering techniques are given in the other chapters of this Handbook. Applications will be discussed using various hospital departments as examples. For individuals not familiar with health care systems, Goldberg and Denoble (1986) describe various hospital depart- ments.

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