DESIGN FOR MANUFACTURING:ORGANIZATIONAL ISSUES

By -

ORGANIZATIONAL ISSUES

Design for manufacturability is to be implemented in an industrial environment. Therefore, we are concerned with (1) increasing the individual engineer’s knowledge in both the areas of design and manufacturing and (2) facilitating better and early communication between design and manufacturing groups. To increase the individual engineer’s knowledge, training courses for manufacturability guide- lines specific and nonspecific to the company concerned should be established. Examples, good and bad, are always helpful. Rotation of job responsibilities between design and manufacturing engineers, when feasible, is also a good way to increase an engineer’s knowledge in design for manufacturability.

To facilitate better and early communication, product and process design should be managed in an integrated manner. For small companies, short product life cycle, or simple products, integrated product and process design task force may prove to be effective. For large companies, long product life cycle, or complex products, product and process engineering should be integrated within one organizational unit, or at least have a close working relationship. In large projects, computer tools may prove to be necessary. The computer tools now available are expert system software shells, CAD / CAM systems, and object-oriented programming tools, as discussed in Section 9.

In managing integrated product and process designs, there are several points worth considering:

1. Select a competent, strong project manager.

2. Quickly develop constraints for the product design and process selection at various levels by the effort of the entire team, that is, list the impossible and infeasible first.

3. Develop the product profile and specification through the team effort, remembering the purpose of a design, and list three other alternatives for every design, be it a subsystem or a component.

4. Aim high, recognizing that quality and cost need not be compromised when development time is compressed.

5. Give enough authorization to the team manager so that quick decisions can be made.

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