Improving Cluster Tool Performance by Finding the Optimal Sequence and Cyclic Sequence of Wafer Handler Moves
| dc.contributor.advisor | Herrmann, Jeffrey | en_US |
| dc.contributor.author | Nguyen, Manh-Quan Tam | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T10:09:47Z | |
| dc.date.available | 2007-05-23T10:09:47Z | |
| dc.date.issued | 2000 | en_US |
| dc.description.abstract | The research aims to develop algorithms that can minimize the total lot processing time (makespan) of cluster tools used for semiconductor manufacturing. Previous research focuses on finding an optimal sequence of wafer handler moves in a cluster tool that has one process chamber in each stage. In practice, if the number of chambers in a stage is more than one, either a pre-specified sequence of moves is given in advance or a dispatching rule is applied. No previous work has addressed the problem of finding an optimal sequence of wafer handler moves to improve performance of cluster tools with more than one chamber in a stage. Cluster tools are highly integrated machines that can perform a sequence of semiconductor manufacturing processes. The performance of cluster tools becomes increasingly important as the semiconductor industry produces larger wafers with smaller device geometry. Some factors that motivate the use of cluster tools, instead of stand-alone tools, include increased yield and throughput, less contamination, and less human intervention. In this research, the cluster tool is modeled as a manufacturing system with a material handling system (wafer handler). The model specifies all constraints that a feasible sequence of wafer handler moves must satisfy. The thesis develops two cluster tool scheduling algorithms. Given the lot size, the wafer handler move time, the in-chamber processing times, and the tool configuration the first algorithm, based on a complete forward branch-and-bound algorithm, searches for an optimal solution from the set of all feasible sequences of wafer handler moves. The second algorithm, a truncated branch-and-bound algorithm, quickly searches for the best solution from the set of feasible cyclic sequences of wafer handler moves. For simple tool configurations, analytical makespan models are also derived. The results show that, in many cases, the search algorithms can significantly reduce the total lot processing time. This reduces tool utilization, reduces manufacturing cycle times, and increases tool capacity. | en_US |
| dc.format.extent | 709811 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/6153 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; MS 2000-3 | en_US |
| dc.subject | computer integrated manufacturing CIM | en_US |
| dc.subject | manufacturing | en_US |
| dc.subject | cluster tool scheduling | en_US |
| dc.subject | optimization | en_US |
| dc.subject | branch-bound algorithm | en_US |
| dc.subject | Systems Integration Methodology | en_US |
| dc.title | Improving Cluster Tool Performance by Finding the Optimal Sequence and Cyclic Sequence of Wafer Handler Moves | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1