標題: Tool planning in the scenario of multiple existing semiconductor fabs
作者: Wu, MC
Hsiung, Y
Hsu, HM
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: capacity planning;cycle time;genetic algorithm;tool planning
公開日期: 1-Nov-2005
摘要: The tool planning problem involves determining how many tools should be allocated to each tool group to achieve a set of objectives. Most previous studies assume that a demand mix has been given for a new factory to be planned. However, when a semiconductor company has several existing fabs, the demand mix for the new fab is not explicitly known, and needs to be allocated from the demand mix of the whole company. This paper presents an integrated approach to determine the optimal demand mix and associated tool plan for the new fab that can minimize the tool cost of the new fab while each fab (new or existing) is requested to meet a predefined target in its mean cycle time. Simulation experiments indicate that the proposed solution is better than that obtained by a heuristic method used in industry. The saving in tool cost for a typical tool planning problem can be over US$ 70 million.
URI: http://dx.doi.org/10.1007/s00170-004-2152-1
http://hdl.handle.net/11536/13144
ISSN: 0268-3768
DOI: 10.1007/s00170-004-2152-1
期刊: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume: 27
Issue: 1-2
起始頁: 145
結束頁: 151
Appears in Collections:Articles


Files in This Item:

  1. 000233464300021.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.