• 품질경영학회지
• /
• 제21권2호
• /
• pp.224-231
• /
• 1993

This paper propose a procedure to form the cell and part family using both of similarity coefficient method and mathematical programming in order to slove the exceptional part and bottleneck machine problems. In the procedure proposed by this paper, the machine duplication and subcontracting are considered to slove the bottleneck machine and intercellular moving part problems An example is given to show how this procedure works.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• pp.259-262
• /
• 2003

Group technology(GT) is a manufacturing philosophy which identifies and exploits the similarity of parts and processes in design and manufacturing. A specific application of GT is cellular manufacturing. the first step in the preliminary stage of cellular manufacturing system design is cell formation, generally known as a machine-part cell formation(MPCF). This paper presents and tests a grouping gentic algorithm(GGA) for solving the MPCF problem and uses the measurements of e(ficacy. GGA's replacement heuristic used similarity coefficients is presented.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.263-266
• /
• 1998

Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• 대한산업공학회지
• /
• 제30권3호
• /
• pp.175-180
• /
• 2004

The machine-part group formation is to group the sets of parts having similar processing requirements into part families, and the sets of machines needed to process a particular part family into machine cells using grid computing. It forms machine cells from the machine-part incidence matrix by means of Self-Organizing Maps(SOM) whose output layer is one-dimension and the number of output nodes is the twice as many as the number of input nodes in order to spread out the machine vectors. It generates machine-part group which are assigned to machine cells by means of the number of bottleneck machine with processing part. The proposed algorithm was tested on well-known machine-part grouping problems. The results of this computational study demonstrate the superiority of the proposed algorithm.

• 산업경영시스템학회지
• /
• 제16권28호
• /
• pp.203-209
• /
• 1993

In Factory Automation environments such as FMS, the formation of machine-part based on GT should be considered. The purpose of this study is to develop a economic heuristic algorithm which considers various elements such as unit processing time, subcontract cost, and functional operation cost, machine processing capacity etc. When this proposed approach is applied to the real situation expected benefits are as follows: the reduction of production lead time work in process, labor force, tooling, rework and scrap, setup time, order time delivery, and paper work, etc.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.375-380
• /
• 2003

This study is concerned with the machine part grouping m cellular manufacturing. To group machines into the set of machine cells and parts into the set of part families, new p-median model considering the production data such as the operation sequences and production volumes for parts is proposed. Unlike existing p-median models relying on the classical binary part-machine incidence matrix which does not reflect the real production factors which seriously impact on machine-part grouping, the proposed p-median model reflects the production factors by adopting the new similarity coefficient based on the production data-based part-machine incidence matrix of which each non-binary entry indicates actual intra-cell or inter-cell flows to or from machines by parts. Computation test compares the proposed p median model favorably.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.137-137
• /
• 1991

This paper compares and evaluates the performances of the two types of mathematical programming models for solving the machine-part cell formation problem in group technology manufacturing : indirect formulation relying on surrogate measure such as similarity coefficient and direct formulation seeking to minimize the number of exceptional elements. New indirect formulation, called the generalized p-median model. is proposed. Unlike existing p-median formulations, proposed formulation includes the classical cell formation problem in which only one process plan exsits for each part as a special case. The proposed new formulation can also deal with the cell formation problem in which alternative process plans exist for a part. The indirect formulation is compared with a new direct formulation which needs much fewer extra variables and constraints than existing direct formulations. Some significant findings from comparative experiment are discussed.

• 경영과학
• /
• 제16권2호
• /
• pp.137-147
• /
• 1999

This paper compares and evaluates the performances of the two types of mathematical programming models for solving the machine-part cell formation problem in group technology manufacturing : indirect formulation relying on surrogate measure such as similarity coefficient and direct formulation seeking to minimize the number of exceptional elements. New indirect formulation, called the generalized {{{{ { p}_{ } }}-median model. is proposed. Unlike existing {{{{ { p}_{ } }}-median formulations, proposed formulation includes the classical cell formation problem in which only one process plan exsits for each part as a special case. The proposed new formulation can also deal with the cell formation problem in which alternative process plans exist for a part. The indirect formulation is compared with a new direct formulation which needs much fewer extra variables and constraints than existing direct formulations. Some significant findings from comparative experiment are discussed.

• 한국정밀공학회지
• /
• 제13권4호
• /
• pp.143-151
• /
• 1996

The concept of cellular manufacturing is to decompose a manufacturing system into subsystems, which are easier to manage than the entire manufacturing system. The objective of cellular manufacturing is to group parts with similar processing requirements into part families and machines into cells which meet the processing needs of part families assigned to them. This paper presents a methodology for cell formation based on genetic algorithm which produces improved cell formation in terms of total moves, which is a weighted sum of both intercell moves and intracell moves. A sample problem is solved for two, three and four cells with an approach based on genetic algorithms.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.