INDUSTRIAL ENGINEERING APPLICATIONS IN HEALTH CARE SYSTEMS:APPLICATION OF INFORMATION SYSTEMS / DECISION SUPPORT TOOLS

By -
APPLICATION OF INFORMATION SYSTEMS / DECISION SUPPORT TOOLS

Many projects conducted by industrial engineers in health care deal with the use of information systems to improve quality and performance. There is a need to take a team approach in information system-related projects. A project team is needed that has individuals from management engineering and information services as well as the user department. The role of an industrial engineer on this team is to first interview the client department to determine the user requirements. The requirements are then used in the request for proposal (RFP) process to obtain proposals from vendors of infor- mation systems. Subsequently, the evaluation of proposals is also done on the basis of meeting these requirements as well as other factors. Industrial engineers are also used in the implementation phase to redesign the manual processes in the client department because these processes usually require major changes after the implementation of an information system. Kachhal and Koch (1989) report on the development of user requirements for a management information system for an operating room and the evaluation of the systems available in the market in meeting these requirements.

Decision support systems (DSS) have become a standard component of hospital information systems. They allow managers to look at financial data on a product line basis. A product line is a collection of one or more diagnostic related groups (DRGs). DSS are able to integrate various sources of data and give managers the capability for ad hoc reporting, building models to project revenues and costs, analyzing various reimbursement scenarios, and the like. The Journal of the Society for Health Systems (1991) published an issue with focus on decision support systems that presents a good overview of DSS in health care.

The other type of DSS used in health care are the clinical decision support systems (CDSS), which use a set of clinical findings such as signs, symptoms, laboratory data, and past history to assist the care provider by producing a ranked list of possible diagnoses. Some CDSS act as alerting systems by triggering an alert when an abnormal condition is recognized. Another set of these systems act as critiquing systems by responding to an order for a medical intervention by a care provider. Several systems that detect drug allergies and drug interactions fall into this category. Another use of CDSS is in consulting systems that react to a request for assistance from a physician or a nurse to provide suggestions about diagnoses or concerning what steps to take next. The application of CDSS in implementing clinical practice guidelines has been a popular use of these systems. Doller (1999) provides a current status of the use of these systems as medical expert systems in health care industry. The author predicts that the major use of CDSS in future will be in implementing clinical guidelines and allowing nonphysicians to handle routine care while directing the attention of true medical experts to cases that are not routine.

While some industrial engineers may be involved in the development of home-grown DSS or CDSS, the role of other industrial engineers is still in the evaluation and cost–benefit analysis of the standard systems available in the market.

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