Full metadata record
DC FieldValueLanguage
dc.contributor.authorWu, MCen_US
dc.contributor.authorHsiung, Yen_US
dc.contributor.authorHsu, HMen_US
dc.date.accessioned2014-12-08T15:18:11Z-
dc.date.available2014-12-08T15:18:11Z-
dc.date.issued2005-11-01en_US
dc.identifier.issn0268-3768en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s00170-004-2152-1en_US
dc.identifier.urihttp://hdl.handle.net/11536/13144-
dc.description.abstractThe 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.en_US
dc.language.isoen_USen_US
dc.subjectcapacity planningen_US
dc.subjectcycle timeen_US
dc.subjectgenetic algorithmen_US
dc.subjecttool planningen_US
dc.titleTool planning in the scenario of multiple existing semiconductor fabsen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s00170-004-2152-1en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGYen_US
dc.citation.volume27en_US
dc.citation.issue1-2en_US
dc.citation.spage145en_US
dc.citation.epage151en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000233464300021-
dc.citation.woscount0-
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.