author Jaewon Park 
2nd author / Hyoung-Gon Lee (Presenter) (Dept. of Industrial Engineering, Seoul National University)
/ Jinwoo Park (Dept. of Industrial Engineering, Seoul National University) 
presenter  
info Date: 2005년 03월 14일 ~ 2005년 03월 15일
City: Seoul
Nation: Korea
Additional Information: 
year 2005 
category IC 
start / end date  
city / nation  
학회 KGW 
keywords wafer fabrication, due-date assignment, neural network 
abstract Assigning due date and delivering timely are an important factor determining the competitive strength of a manufacturing company. Once an order received, we should check the inventory status before anything else. If the stock runs short, we should make the product. In this case, predicting the cycle time of the product is important for the due date assignment.
Due to the complicated process flow of wafer fabrication, distinctive approaches that differ from common scheduling method are required. Especially, more than one thousand different products might be produced simultaneously in wafer fabrication facilities producing multiple product types like ASIC or power semiconductor. Besides, each product type has different process flow and product types and layers that can be processed together in each batch processing equipment are predetermined. Because of Such characteristics, estimating the flow time of each product is very difficult task.
In this study, we propose a method to predict the cycle time and assign the due date as accurately as possible even if the product mix varies continuously. For this, we group the products according to the similarity of process flow and use the information from the groups to predict the cycle time using artificial neural network. The experimental results show that the proposed method is superior to common due date assignment method. 
번호 category 학회 제목 author presenter year
95 IC  CIE  A batch splitting heuristic for dynamic job shop scheduling problem Hanil Jeong    1996 
94 IC  CIE  A decision support model for the initial design of FMS Hosub Shin    1996 
93 IC  ICARCV  A Discrete Control Approach to Robotic Cell Operating System Design Jonghun Park    1996 
92 IC  PCM  An Intelligent Batch Splitting method for Schedule Improvement in MRP Environment Hanil Jeong    1996 
91 IC  PCM  FMS Scheduling Strategies in a Distributed Coordination Environment Jonghun Park    1996 
90 IC  ICPR  A Study on FMS Scheduling Problems Based on Priority Functions Generated by Genetic Programming ChangUk Kim    1997 
89 IC  ICPR  A Scheduling Algorithm considering Subcontract cost in MRP Environment Kichang Lee    1997 
88 IC  IFAC on IMS  A Weighted Load Balancing Heuristic that Minimizes Makespan in Alternative Routing and Machine Environment Kidong Kim    1997 
87 IC  APIEMS  An Integrated Approach for Loading and Scheduling of a Flexible Manufactureing System Sangbok Woo    1999 
86 IC  APIEMS  A Study on Developing a Scheduling System in Alternative Routing and Machine Environment Kidong Kim    1999 
85 IC  IW on IMS  Maximally permissive adaptive control of an automated manufacturing cell Sangkyun Kim    1999 
84 IC  ICPR  An Algrorithm for Job Shop Scheduling Problem with Due Date Constraints Considering Operation Subcontract Daeyoung Chung    2000 
83 IC  INFORMS-KORMS  Hybrid Algorithms in Integrated Quality Design & Scheduling Jonghan Kim    2000 
82 IC  INFORMS-KORMS  Development of capacitated event-driven MRP components using object oriented method Seunghyun Yoon    2000 
81 IC  PAIS  Knowledge Acquisition using Neural Network and Simulator Kitae Shin    2001 
80 IC  SeoulSim  Design for a Hybrid System of Integration Kanban with MRPII Taeyoung Song    2001 
79 IC  GECCO  A Study on the Resource Allocation Planning for Automated Container Terminals Yangja Jang    2001 
78 IC  ICPR  Development of a Decision Support System for the formulation of Manufacturing Kichang Lee    2001 
77 IC  ICRA  An On-Line Production Scheduler using Neural Network and Simulator based on Manufacturing System State file Kitae Kim    2001 
76 IC  PEDAC  A Shifting Bottleneck Procedure for Job-Shop Scheduling minimizing the Sum of Earliness and Tardiness Daeyoung Chung    2001