DESIGN FOR MANUFACTURING:DRAWINGS

By -

DRAWINGS

Drawings represent the heart of design for manufacturing because they are the principal means of communication between the functional designer and the producer of the design. They alone control and completely delineate shape, form, fit, finish, and interchangeability requirements that lead to the most competitive procurement. An engineering drawing, when supplemented by reference specifi- cations and standards, should permit a competent manufacturer to produce the part shown within the dimensional and surface tolerance specifications provided. It is the engineering drawing that should demonstrate the most creative design for manufacturing thinking.

Certain product specifications may not be included on the drawings in view of space constraints. Product specifications such as quality assurance checkpoints, inspection procedures, and general de- sign criteria may be separately summarized but should always be cross-referenced on the engineering drawing. At all times the design engineer must remember that the end product drawing is the com- munication medium between the design engineer and the producer. It is the basis for interchangea- bility for repair parts; it provides the form, fit, and function to the manufacturing function.

Too often the language of drawings is incomplete. For example, chamfers may be indicated but not be dimensioned; worse yet, they may be desired but not even be shown. Frequently the finish desired is omitted. Complex coring may be incorrectly shown. The principal errors common to many designs are as follows:

1. Design is not conducive to the application of economic processing.

2. Designer has not taken advantage of group technology and creates a new design for an already existing item.

3. Design exceeds the manufacturing state of the art.

4. Design and performance specifications are not compatible.

5. Critical location surfaces have not been established.

6. Design specifies the use of inappropriate items.

7. Design specifications are not definitive.

8. Inadequate consideration has been given to measurement problems.

9. Tolerances are more restrictive than necessary.

10. Item has been overdesigned.

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