PLANT AND FACILITIES ENGINEERING WITH WASTE AND ENERGY MANAGEMENT:TECHNOLOGICAL CONCEPTS FOR PLANT ENGINEERING

By -

TECHNOLOGICAL CONCEPTS FOR PLANT ENGINEERING

Throughout this chapter, reference has been made to many electronic and computer applications with which plant and facilities engineers need to be familiar. Notable among these is the computerized maintenance management system (CMMS), which is often used by plant engineers to schedule and control maintenance and operations in plant engineering areas. This system is described in some detail in Section 3.4.

The second electronic system under the control of plant engineers is the facility management or building automation system, which usually includes an energy controller. These systems are described in Section 5.3.

Depending on the type of operation, process-control computer systems interconnected with man- ufacturing, engineering, and administration are often needed. Key to interconnectivity is the instal- lation of a fieldbus through which data are transmitted among users. Manufacturing execution systems operate on a distributed control network ring (Kamal Zafar 1998).

Another group of electronic systems used by plant engineers pertains to preventive and predictive maintenance. A description of these systems appears briefly in Section 3.4 and is described more fully in Chapter 59, which pertains specifically to maintenance.

The importance of understanding new technologies has been emphasized in this chapter by out- lining the knowledge and skills that a successful plant and facilities engineer needs upon assuming that position. Because the above-mentioned systems are highly varied and extremely complex, it is not within the scope of this chapter to describe these technologies in detail. By being aware of the many possibilities for improvement through technological concepts, the plant engineer can take steps to become competent in the use of electronic equipment and / or to be able to manage persons who are familiar with the details.

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