※ 기관로그인 시 무료 이용이 가능합니다.
※ 학술발표대회집, 워크숍 자료집 중 4페이지 이내 논문은 '요약'만 제공되는 경우가 있으니, 구매 전에 간행물명, 페이지 수 확인 부탁 드립니다.
4,000원
원문정보
초록
영어
This paper analyses the tool switching problem in the dynamic environment, where parts to be processed on a flexible machine arrive randomly. As the total number of tools required to Process a set of parts on the machine is generally larger than the available magazine storage capacity, tool switches between parts are usually necessary. We assume that tool switching must be made just before the processing of the parts. Since the time required for tool switches can be significant relative to processing time and cause the processing of parts to be delayed, it is desirable to minimize the number of tool switches. Therefore, we present one heuristic algorithm to minimize the total number of tool switches and the t)reposed heuristic is compared with the KTNS (Keep Tool Needed Soonest) policy on randomly generated problems.
목차
Abstract I. Introduction II. Problem description III. A heuristic for the dynamic tool switching problem IV. Computational results V. Conclusions References
저자
Song Chang-Yong [ Department of Industrial Engineering, Halla University ]
Shinn Seong-Whan [ Department of Industrial Engineering, Halla University ]