Abstract
We propose to use information regarding the fab's future state for Overhead Hoist Transport (OHT) dispatching, which is named as ‘predictive dispatching’ in this paper. Unlike conventional dispatching methods, two kinds of information are additionally considered in our proposed methods: the expected arrival time of jobs in the near future and the time needed for occupied vehicles to become idle. We firstly develop Basic Predictive Dispatching (BPD) under the assumption that job arrival time prediction is error-free. We demonstrate that BPD consistently surpasses conventional benchmark dispatching methods, even when job arrival time prediction contains a certain level of error. However, as the level of error increases, the performance of BPD deteriorates. To improve BPD's performance in the environment with prediction error, we take the certainty level of job arrival time prediction into consideration in our second method called Certainty Weighted Predictive Dispatching (CWPD). Both BPD and CWPD formulate the OHT dispatching problem as a linear assignment problem, but two different matching cost functions are employed separately. By conducting experiments on a sample semiconductor fab, we validate the effectiveness of our proposed approaches. The superiority of CWPD over BPD in the environment with prediction error is also verified.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.