INDUSTRIAL ENGINEERING APPLICATIONS IN HEALTH CARE SYSTEMS:APPLICATIONS OF METHODS IMPROVEMENT AND WORK SIMPLIFICATION

By -
APPLICATIONS OF METHODS IMPROVEMENT AND WORK SIMPLIFICATION
Introduction

The terms methods improvement, methods engineering, operations analysis, and work simplification have been used synonymously in industrial engineering literature. These techniques use a systematic procedure to study and improve methods for carrying out any set of activities to accomplish a task. In health care systems, these could be the work methods used in the actual delivery of health care to the patients or the work methods utilized in support activities. One common tool used to document an existing process or work method is a flowchart, which can also be used to document a new process as it is developed prior to implementation. A flowchart allows a critical examination of the various steps of the process and assists in the identification of unnecessary steps and inefficiencies in the process. Flowcharts show each step of the process as well as decision points and various courses of action based upon the decision.

Other tools available for methods improvement that have been used in health care systems include a flow diagram and a paperwork simplification chart. A flow diagram can be used to visualize the flow of material and patients in a facility. It can help identify areas of congestion and assist in the planning of the physical layout of facilities. Paperwork-simplification charts are used to analyze and improve paper documents to provide the needed control and communication.

Application of a Flowchart to Document Patient Flow in an Outpatient Clinic Figure 1 shows the flowchart for patient flow in an outpatient clinic starting from the time when a patient arrives at the reception counter to the time the patient leaves the clinic after the visit. This chart shows all the steps a patient goes through to complete a visit with the physician. Management engineers can critically examine each step to study the possibility of eliminating, simplifying, or modifying it. For example, this flowchart indicates that patients have to stand in line till a receptionist is available to serve them. If this wait is excessive, one alternative could be to have a sign-up sheet so the patients could sign it and then take a seat. When available, the receptionists could then call the patients to the counter to serve them.

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