• Title/Summary/Keyword: exceptional group

Search Result 54, Processing Time 0.024 seconds

The Machine-Part Group Formation for Minimizing the tool Exchange (공구 교체 횟수에서 최소로 하는 기계-부품그룹 형성)

  • 홍상우
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.45
    • /
    • pp.329-332
    • /
    • 1998
  • This Paper proposes a mathematical model to solve the cell formation problem with exceptional elements, Exceptional elements are bottleneck machines and exceptional parts that span two or more manufacturing cells. The model suggests whether it is cost-effective to eliminate an EE (by machine duplication or part subcontracting), or whether the intercellular transfer caused by the EE should remain in the cell formation. It provides an optimal solution for resolving the interaction created by EE in the initial cell formation solution. In addition, the model recognizes potentially advantageous mixed strategies ignored by previous approaches.

  • PDF

Machine-part Group Formation Methodology for Flexible Manufacturing Systems (유연생산시스템(FMS)에서의 기계-부품그룹 형성기법)

  • Ro, In-Kyu;Kwon, Hyuck-Chun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.17 no.1
    • /
    • pp.75-82
    • /
    • 1991
  • This research is concerned with Machine-Part Group Formation(MPGF) methodology for Flexible Manufacturing Systems(FMS). The purpose of the research is to develop a new heuristic algorithm for effectively solving MPGF problem. The new algorithm is proposed and evaluated by 100 machine-part incidence matrices generated. The performance measures are (1) grouping ability of mutually exclusive block-diagonal form. (2) number of unit group and exceptional elements, and (3) grouping time. The new heuristic algorithm has the following characteristics to effectively conduct MPGF : (a) The mathematical model is presented for rapid forming the proper number of unit groups and grouping mutually exclusive block-diagonal form, (b) The simple and effective mathematical analysis method of Rank Order Clustering(ROC) algorithm is applied to minimize intra-group journeys in each group and exceptional elements in the whole group. The results are compared with those from Expert System(ES) algorithm and ROC algorithm. The results show that the new algorithm always gives the group of mutually exclusive block-diagonal form and better results(85%) than ES algorithm and ROC algorithm.

  • PDF

Machine-Part Group Formation Problem with the Number of Cells and Cell Size (기계셀의 수와 크기가 있는 기계-부품그룹 형성)

  • Kim, Yea-Geun;Oh, Gun- Chul
    • IE interfaces
    • /
    • v.2 no.2
    • /
    • pp.15-24
    • /
    • 1989
  • When we design, plan, and schedule for group technology, the limitation on the machine cells and cell size may occur. The purpose of this study is to find machine cells and part families to minimize the exceptional elements, constraining both the number of machine cells and the cell size. To solve this problem, the algorithm extending Kusiak's p-median method is proposed. In the proposed algorithm, the method finding initial solution and reducing the number of constraints is presented for computational efficiency. The proposed algorithm is evaluated and compared with well-known algorithms for machine-part group formation in terms of the exceptional elements. An example is shown to illustrate the proposed algorithm.

  • PDF

An Algorithm for Minimizing Exceptional Elements Considering Machine Duplication Cost and Space Constraint in Cellular Manufacturing System (기계중복비용과 공간제약을 고려한 예외적 요소의 최소화 알고리듬)

  • Chang, Ik;Chung, Byung-hee
    • IE interfaces
    • /
    • v.12 no.1
    • /
    • pp.10-18
    • /
    • 1999
  • Job shop manufacturing environments are using the concept of cellular manufacturing systems(CMS) which has several advantages in reducing production lead times, setup times, work-in-process, etc. Utilizing the similarities between cell-machine, part-machine, and the shape/size of parts, CMS can group machines and parts resulting in improved efficiency of this system. However, when grouping machines and parts in machine cells, there inevitably occurs exceptional elements(EEs), which can not operate in the same machine cell. Minimizing these EEs in CMS is a critical point that improving production efficiency. Constraints in machine duplication cost, machining process technology, machining capability, and factory space limitations are main problems that prevent achiving the goal of maintaining an ideal CMS environment. This paper presents an algorithm that minimizes EEs under the constraints of machine duplication cost and factory space limitation. Developing exceptional operation similarity(EOS) by cell-machine incidence matrix and part-machine incidence matrix, it brings the machine cells that operate the parts or not. A mathematical model to minimize machine duplication is developed by EOS, followed by a heuristic algorithm in order to reflect dynamic situation resulting from minimizing exceptional elements process and the mathematical model. A numerical example is provided to illustrate the algorithm.

  • PDF

{M_1},{M_2}/M/1$ RETRIAL QUEUEING SYSTEMS WITH TWO CLASSES OF CUSTOMERS AND SMART MACHINE

  • Han, Dong-Hwan;Park, Chul-Geun
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.2
    • /
    • pp.393-403
    • /
    • 1998
  • We consider $M_1,M_2/M/1$ retrial queues with two classes of customers in which the service rates depend on the total number or the customers served since the beginning of the current busy period. In the case that arriving customers are bloced due to the channel being busy, the class 1 customers are queued in the priority group and are served as soon as the channel is free, whereas the class 2 customers enter the retrical group in order to try service again after a random amount of time. For the first $N(N \geq 1)$ exceptional services model which is a special case of our model, we derive the joint generating function of the numbers of customers in the two groups. When N = 1 i.e., the first exceptional service model, we obtain the joint generating function explicitly and if the arrival rate of class 2 customers is 0, we show that the results for our model coincide with known results for the M/M/1 queues with smart machine.

  • PDF

A Registry Program for Familial Gastric Cancer Patients Referred to Cancer Institute of Iran

  • Etemadi, Mehrnoosh;Pourian, Mandana;Shakib, Asyeh;Sabokbar, Tayebeh;Peyghanbari, Vahideh;Shirkoohi, Reza
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.5
    • /
    • pp.2141-2144
    • /
    • 2014
  • Background: Gastric cancer is the second most common cause of cancer death. It has a poor prognosis with only 5-10% of hereditary etiology. If it is diagnosed, it could be helpful for screening the other susceptible members of a family for preventive procedures. Usually it is identified by symptoms such as presence of cancer in different members of family, some special type of pathology such as diffused adenocarcinoma, having younger age and multiple cancer syndromes. Hence, designing a registry program can be a more practical way to screen high risk families for a preventive program. Materials and Methods: Based on the inclusion criteria, a questionnaire was prepared. After pilot on a small number of patients, the actual data was collected from 197 patients and processed in SPSS 16.0. Results: Totally, 11.8% of the patients were younger than 45 years old. Blood type 'A' was dominant and males had a higher risk behavior with higher consumption of unhealthy food. Adenocarcinoma was reported in majority of cases. 21.8% of the patients had the including criteria for familial gastric cancer (FGC). Conclusions: The high percentage of FGC population compared to the other studies have revealed a need to design an infrastructural diagnostic protocol and screening program for patients with FGC, plus preventive program for family members at risk which could be done by a precise survey related to frequency and founder mutations of FGC in a national registry program.

Cell Formation Using Fuzzy Multiobjective Nonlinear Mixed-integer Programming (다목적 비선형 혼합정수계획법을 이용한 셀 형성)

  • 오명진
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.61
    • /
    • pp.41-50
    • /
    • 2000
  • Cell formation(CF) Is to group parts with similar geometry, function, material and process into part families, and the corresponding machines into machine cells. Cell formation solutions often contain exceptional elements(EEs). Also, the following objective functions - minimizing the total costs of dealing with exceptional elements and maximizing total similarity coefficients between parts - have been used in CF modeling. Thus, multiobjective programming approach can be developed to model cell formation problems with two conflicting objective functions. This paper presents an effective cell formation method with fuzzy multiobjective nonlinear mixed-integer programming simultaneously to form machine cells and to minimize the cost of eliminating EEs.

  • PDF