• 기계저널
• /
• 제33권2호
• /
• pp.134-144
• /
• 1993

조립성 평가법은 동시공학을 추진하는 하나의 도구로써 전자산업의 시장과 환경의 변화에 대응할 수 있는 토탈 개발 시스템이다. 조립성 평가법으로부터 얻는 효과는 개발 납기의 단축, 제조원 가의 절감, 생산성 향상, 품질 향상 등을 꼽을 수 있다. 조립성 평가법의 적용 추진을 지속하여 제품 설계자들의 설계 기술이 질적으로 향상되어 고객이 원하는 경쟁력 있는 제품을 제공할 수가 있도록 해야할 것이고, 따라서 향후 모든 상품화 설계는 조립성 평가법이 완제품 제조업의 신 상품 개발 기본 업무로 규정되어야 할 것이다. 제조성이 고려된 제품의 구조와 부품의 형상으 로부터 공정설계, 제조원가 산출 및 양산시에 필요한 전용기 등을 도출하여 개발해야 할 설비를 동시에 개발 착수할 수 있고, 소재개발로부터 신규 부품과 그 제작 공법의 개발까지 모든 분야에 대하여 제안해 줄수 있는 제조성 평가법이 개발되어야 하고, 앞으로는 PCB조립성 평가법, 소재 가공성(성형성, 절삭성, 접합성, 처리성)평가법, 재활용 평가법, 신뢰성 평가법 등이 포함된 지능형 설계 평가법의 출현을 기대해야 할 것이다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2007년도 춘계학술대회A
• /
• pp.614-619
• /
• 2007

The importance of simulation of plastic flow in the injection mold is increasing as the parts are more complex, but the small-scale enterprises can't afford to invest for the infra individually. CAE (Computer Aided Engineering) service was naturally born based on these needs. This paper presents the engineering collaboration model between the large and the small/medium enterprises in the field of injection molds. Based on the engineering collaboration hub and CAE service, small-scale enterprises could research the necessary technology and develop the proper products. The analysis results of CAE are provided by the integrated visualization system on the web. This paper also deals with the delivery shorting process of CAE service for electric/electronic parts which should meet the needs of customers as soon as possible.

• 한국경영과학회지
• /
• 제24권3호
• /
• pp.73-82
• /
• 1999

In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

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

생산성 향상, 재고의 최소화, 납기일의 준수, 자원의 최대활용등을 위해 그동안 많은 생산관리 기법이 제시되어 왔으며 그중 GT, MRP, JIT 기법이 가장 많이 사용되고 있다. 각각의 시스템은 모두 장단점을 가지고 있기 때문에 이들 시스템을 혼합하면 상호간의 단점을 보완할 수 있을 것이다. GT 기법은 부품의 유사성을 이용한 기존자료의 검색 및 그룹가공을 통한 생산성 향상에 유용하며, MRP 기법은 기초자료를 이용하여 생산 및 자재계획을 동시에 수립할 수 있기 때문에 계획수립에 유용하며, JIT 기법은 낭비의 제거, 재고의 제로화, 간판을 이용한 현장관리 등을 할 수 있기 때문에 실시단계에 유용하다. 본 연구에서는 GT, MRP, JIT 기법을 비교 분석하고 이를 상호 보완할 수 있는 알고리즘을 개발하여 GT, MRP, JIT 혼합 생산시스템의 모델을 제시하고자 한다.

• 산업공학
• /
• 제11권3호
• /
• pp.1-13
• /
• 1998

This paper addresses a scheduling scheme for Flexible Flow Shop(FFS) in the case that a factory is a sub-plant of an electronic device manufacturing plant. Under this environment, job orders for the sub-plants in the production route are generated together with job processing time bucket when the customer places orders for final product. The processing time bucket for each job is a duration from possible release date to permissible due date. A sub-plant modeled FFS should schedule these jobs orders within time bucket. Viewing a Printed Circuit Board(PCB) assembly line as a FFS, the developed scheme schedules an incoming order along with the orders already placed on the scheduled. The scheme consists of the four steps, 1)assigning operation release date and due date to each work cells in the FFS, 2)job grouping, 3)dispatching and 4)machine allocation. Since the FFS scheduling problem is NP-complete, the logics used are heuristic. Using a real case, we tested the scheme and compared it with the John's algorithm and other dispatching rules.

• 산업공학
• /
• 제11권3호
• /
• pp.181-191
• /
• 1998

In the make-to-order (MTO) manufacturing environment, one of the important issues is setting attainable delivery dates for customer orders, which significantly affects the performance of the MTO manufacturing. Although this topic has received considerable attention in the literature, most of the efforts took a lower level approach that is concerned primarily with the effect of various delivery date assignment methods on the relative performance of some dispatching rules. This paper proposes the delivery date decision support system which takes a higher level approach of integrating the marketing and production planning functions with the consideration of the current capacity and the workload smoothing. The proposed system has been implemented in a Rotating Machinery Shop and the results of the implementation showed good performance.

• 한국경영과학회지
• /
• 제26권4호
• /
• pp.143-153
• /
• 2001

In this study we develop a computer simulation model to evaluate the effects of various production and order processing policies measured in terms of on-time delivery rate and average waiting time of job orders. Policies considered include : eliminating inflated due date, lot splitting, loss time reduction, attaining full flexibility in production lines, and selective order promising scheme. Actual order-production data from a chemical company were used in the simulation model. Based on the simulation results, we make several suggestions that can significantly reduce the production lead time and increase the on-time delivery rate.

• 한국경영과학회지
• /
• 제21권3호
• /
• pp.75-88
• /
• 1996

This paper presents an efficient heuristic technique for minimizing the objectives related to tardiness such as total tardiness, maximum tardiness and root mean of tardiness in the job shop scheduling. The heuristic technique iteratively improves an active schedule through exploring the schedule's neighborrhood, using operation move methods. The move operatio is defined on an active chain of tardy jobs in the active schedule. To find the move operations which have a high probability of reducing tardiness, we develop move methods by exploiting the properties of active chains. Our technique is compared with the two existing heuristic techniques, that is, MEHA(Modified Exchange Heuristic Algorithm) and GSP(Global Scheduling Procedure) under the various environmental with the three levels of due date tightness and several sized problems. The experimental results show that the proposed technique outperforms the two exissting techiques in terms of solution quality and computation time.

• 경영과학
• /
• 제29권3호
• /
• pp.157-168
• /
• 2012

In this study, we consider an order promising problem at parallel machine shops where orders arrive dynamically. We develop methods for the problem, which instantly quote the due-dates of arrived orders. In this study, we first propose methods which can estimate flow times of orders, in which the current and future inventory status as well as the specific scheduling scheme used in the shop are taken into account, and then the due-dates are set by the order promising methods using the estimation results. The quoted due-dates of orders are compared with the actual completion times of those which are obtained from the simulation runs. The series of computational experiments show that the superior performance of the proposed methods in terms of the accuracy of due-date quotation.

• 월간 기계설비
• /
• 제12호통권221호
• /
• pp.62-64
• /
• 2008

현장에서는 주공정과 예산관리를 중심으로 공사진행을 하고, 공정이 90% 이상 달성되었거나 또는 잔여공기가 9개윌 정도 남아 있으면 모든 공정을 재검토하기 바란다. 우선 하청시로부터 잔여 공사에 대한 공정표를 받아, 잔여공시 1개월 전에 준공될 수 있는지 검토한다. 9개월 정도 앞서 준공기일을 검토하는 것은, 자재납기가 장기간(7개월 정도) 소요되는(플랜트 Control Panel 등) 자재의 발주여부를 검토하고, 잔여공기 내에 정상 작업으로 공기 내 준공이 불가하다고 예측될 경우, 3개월 또는 6개월 돌관작업 계획을 세우기 위함이다. 잔여공기가 3개월 정도 남아 있을 때, 시설물을 인계(Hand Over) 하기 위해 본격적인 준비를 한다. 준공이란 "계약적으로 발주자가 실제적으로 계약서에 의도된 목적으로 사용할 수 있는 상태(표준계악일반조건 48. 1)"를 말하므로, 이 점에 착안하여 발주자가 시설물을 제때에 사용하지 못함으로써 발생되는 지체보상금(Liquidated Damage)을 물지 않도록 작전을 세운다.