• 산업공학
• /
• 제24권1호
• /
• pp.87-96
• /
• 2011

In this paper, we address an optimization problem for minimizing the inspection and rework cost in an inspection-rework system, which forms a network of nodes including a K-stage inspection system, storage areas for items, a source inspection shop, and a re-inspection shop. We assume that (n, 0) acceptance sampling is performed in the source inspection shop and that only 100(1-r)% of items of rejected lots are re-inspected in the re-inspection shop. Since all the nodes are interrelated, in order to formulate our steady-state objective function, we make a steady-state network flow analysis between nodes, and derive both the steady-state amount of flows between nodes and the steady-state fraction defectives by solving a nonlinear balance equation. Finally we provide some fundamental properties and an enumeration procedure for determining the optimal values of (K, r) which both minimizes our objective function and attains a given target average outgoing quality.

• 대한조선학회논문집
• /
• 제43권3호
• /
• pp.392-398
• /
• 2006

A prototype of MES(Manufacturing Execution System) applied to panel assembly shop is implemented by using PDA(Personal Digital Assistant) and wireless database web server. The system is developed based on the Dot Net framework. The prototype can exchange the manufacturing execution data between production managers in the control room and workers in the factory through wireless internet communication. Manufacturing model of the panel shop is designed by using IDEF0 and UML method to understand the characteristics of the information and the data entities from the PPR-S view. Several issues in the shop were revealed from the manufacturing model analysis. The most typical problem was the lack of information sharing between the managing workers and the assembly workers. The problem prevents the workers and labors from sharing the process information and continuous workpiece flow In interactive way. To increase the information and data flow, a wireless internet based system is implemented and PDAs are linked together to exchange the process planning data and in-process data between the workers. It is anticipated that PDA and the implemented system can enable the process control at each process stages to obtain the well-organized operation.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.193-201
• /
• 1993

일반적으로 FMS를 효율적으로 가동시키기 위해서는 MC에서의 가공에 필요한 여러가지 공구를 어떻게 배분할 것인가가 중요한 문제로 대두된다. 그런데 복수의 MC를 대상으로 하는 경우, 각 MC마다 가공에 필요한 공구를 전종류 중복시켜서 배분하는 '전기능형' 공구배분법은 거의 100%에 가까운 가동율을 달성할 수 있으며 운용면에서도 용이하지만, 현실적으로 적용하기에는 여러가지 문제점이 많다. 따라서, 이를 해결하기 위해서는 공구를 완전히 분할해서 배분하는 '완전기능분산형'이나 일부의 공구만을 중복시켜 배분하는 '기능분산형'의 공구배분법이 바람직하다. 본 연구에서는 2기계 Flow-Shop형 FMS를 대상으로 완전기능분산형 및 기능분산형의 공구배분법에 대한 발견적 해법을 각각 제안하고, 제안된 해법이 FMS의 가동율에 미치는 영향을 분석하였다.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.47-57
• /
• 1992

The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGV's) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system. An algorithm is developed to determine the optimal job sequence which minimizes the vehicle idle time on the line and the production makespan by the use of the entering interval and travel time between workcenters. An entering times of AGV's and the minimum number of AGV's required are calculated by optimal job sequence. When the numbe rof AGV's is limited, enterling times of AGV's are adjusted to maximize the efficient use of vehicles. A numerical example is given to illustrate the application of the algorithm.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.35-35
• /
• 1993

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 1999년도 춘계공동학술대회:정보화시대의 지식경영
• /
• pp.420-420
• /
• 1999

• 한국생산제조학회지
• /
• 제22권2호
• /
• pp.281-286
• /
• 2013

As the product lifecycle is getting shorter and various models should be released to respond to the needs of customers and markets, automation-based flexible production line has been recognized as the core competitiveness. According to these trends, system vendors supply cell-level systems such as FMC(Flexible Manufacturing Cell) that is integration of core functions of FMS(Flexible Manufacturing System) and RMC(Reconfigurable Manufacturing Cell) that can easily extend components of FMC. In the cell-based environment, flexible management for shop floor composed of existing job shop, FMCs and RMCs from various system vendors has emerged as an important issue. However, there could be some problems on integrated operation between heterogeneous cells to use vendor-specific cell controllers and on seamless information flow with high level systems such as ERP(Enterprise Resource Planning). In this context, this paper proposes process management systems supporting integrated shop operation of heterogeneous multi-cell based flexible manufacturing environment: First of all, (1) Integrated Shop Operation System to apply the process management system is introduced, and (2) Multi-Layer BOP(Bill-Of-Process) model, a backbone of the process management system, is derived with its data structure. Finally, application of the proposed model is illustrated through system implementation results.

• 대한산업공학회지
• /
• 제35권4호
• /
• pp.257-265
• /
• 2009

This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel machines at each stage as well as the sequence of the jobs assigned to each machine. Due to the complexity of the problem, we suggest search heuristics, tabu search and simulated annealing algorithms with a new method to generate neighborhood solutions. In particular, to evaluate and select neighborhood solutions, three surrogate objectives are additionally suggested because not much difference in the number of tardy jobs can be found among the neighborhoods. To test the performances of the surrogate objective based search heuristics, computational experiments were performed on a number of test instances and the results show that the surrogate objective based search heuristics were better than the original ones. Also, they gave the optimal solutions for most small-size test instances.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.631-634
• /
• 1996

This paper describes an intelligent user interface to define simulation models from the process and resource models. It also explains an automatic program generator of discrete event simulation model for shop floor control in a flexible manufacturing system. Especially, the paper is focused on the design and development of methodology to automate simulation modeling from the system description. Describing a shop floor control system in simulation is not an easy task since it must resolve various decision problems such as deadlock resolution, part dispatching, resource conflict resolution, etc. The program generator should be capable of constructing a complete discrete simulation models for a multi-product and multi-stage flow shop containing the above mentioned problems.

• 대한산업공학회지
• /
• 제35권3호
• /
• pp.194-202
• /
• 2009

In this paper, we address an optimization problem and a case study for minimizing the cost of inspections incurred throughout an inspection system, which includes a K-stage inspection system, a source inspection shop, and a re-inspection shop. In order to formulate the inspection cost function, we make a time-based flow analysis between nodes (or shops), and derive the limiting sizes of flows between nodes and limiting defective rates by solving a set of nonlinear balance equations. It turns out that the number of items reworked throughout the inspection system is invariant irrespective of the defective rate of items moved through the K-stage inspection system. Hence we define the inspection cost as the total number of items inspected, and we provide an enumeration method for determining an optimal value of K which minimizes the number of items inspected.