INDUSTRIAL ENGINEERING APPLICATIONS IN HEALTH CARE SYSTEMS:APPLICATION OF QUALITY-IMPROVEMENT TOOLS

By -
APPLICATION OF QUALITY-IMPROVEMENT TOOLS

The concepts of quality control, quality improvement, and quality management in the United States largely evolved from the efforts of Dr. W. Edward Deming, Dr. Joseph Juran, and Philip Crosby. Manufacturing industries were first to apply these concepts to achieve significant improvements in the quality of manufactured goods while reducing costs. During the late 1980s, the health care industry started using some of these methods to improve quality of health care delivery and reduce costs. Many hospitals started continuous quality improvement (CQI) and total quality management (TQM) programs. Sahney et al. (1989) summarize 10 common points from the quality philosophies of Deming, Juran, and Crosby and conclude that they can be applied to any industry, including the health care industry, to improve quality.

Continuous quality improvement focuses on improvement of various processes in a health care organization. It starts with identifying the customers and their needs for each of the processes. The objective is to improve the processes to meet the needs of the customers. All the changes are data driven. Key quality characteristics are identified and measured to track improvements. The physicians and hospital employees are trained in quality concepts and tools for improvement. Some of these tools are the Pareto chart, the cause–effect (or fishbone) diagram, flowcharts, run charts, and control charts. These tools assist in the documentation, analysis, and improvement of processes. Sahney and Warden (1991), and Gaucher and Coffey (1993) give a good overview of the application of CQI approach in health care. A popular CQI methodology is FOCUS-PDCA. Griffith et al. (1995) give a description of this methodology.

Another term in the quality improvement effort that has gained popularity during the late 1990s is process reengineering. While the CQI approach looks at making incremental improvements in the processes, reengineering efforts look at radical redesign of systems and processes to achieve major improvements in the cost and quality of services (Hammer and Champy 1995). Kralovec (1993) provides a good introduction to applying reengineering techniques to health care. The proceedings of the Quest for Quality and Productivity in Health Services Conferences that have been held each year since 1989 provide numerous examples of the application of total quality management, CQI, and reengineering methods in health care systems.

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