Earticle

초록

영어

Among the semiconductor If-chips, unlike memory chips, a majority of Application Specific IC(ASIC) products are produced by customer orders, and meeting the customer specified due date is a critical issue for the case. However, to the one who understands the nature of semiconductor manufacturing, it does not take much effort to realize the difficulty of meeting the given specific production due dates. Due to its multi-layered feature of products, to be completed, a semiconductor product(called device) enters into the fabrication manufacturing process(FAB) repeatedly as many times as the number of the product specified layers, and fabrication processes of individual layers are composed with similar but not identical unit processes. The unit process called photo-lithography is the only process where every layer must pass through. This re-entrant feature of FAB makes predicting and planning of due date of an ordered batch of devices difficult. Parallel machines problem in the photo process, which is bottleneck process, is solved with restricted roll out algorithm. Roll out algorithm is a method of solving the problem by embedding it within a dynamic programming framework. Restricted roll out algorithm Is roll out algorithm that restricted alternative states to decrease the solving time and improve the result. Results of simulation test in condition as same as real FAB facilities show the effectiveness of the developed algorithm.

목차

Abstract
 1. 서론
 2. 본론
  2.1 병렬 기계 문제의 정의
  2.2 roll out 알고리듬
  2.3 비용 추정 함수 알고리듬
  2.4 제한된 roll out 알고리듬
  2.5 결과 분석
 3. 결론
 4. 참고문헌

키워드

저자

• 백종관 [ Baek Jong Kwan | 서일대학 산업시스템경영과 교수 ]
• 김형준 [ Kim Hyung Jun | 서일대학 산업시스템경영과 교수 ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  대한안전경영과학회지 [Journal of Korea Safety Management & Science]

• 간기

  계간

• pISSN

  1229-6783

• eISSN

  2288-1484

• 수록기간

  1999~2025

• 십진분류

  KDC 530 DDC 620