Skip to main content

Advertisement

Log in

Tool planning in the scenario of multiple existing semiconductor fabs

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kao CE, Chou YC (1999) A tool portfolio planning methodology for semiconductor wafer fabs. IEEE Proceedings of the eighth international symposium on semiconductor manufacturing, pp 84–90

  2. Grewal NS, Bruska AC, Wulf TM, Robinson JK (1998) Integrating targeted cycle-time reduction into the capital planning process. Proceeding of the 1998 winter simulation conference, pp 1005–1010

  3. Mollaghsemi M, Evans GW (1994) Multicriteria design of manufacturing systems through simulation optimization. IEEE Trans Syst Man Cybern 24(9):1407–1411

    Google Scholar 

  4. Chen LH, Chen YH (1996) A design procedure for a robust job shop manufacturing system under a constraint using computer simulation experiments. Comput Ind Eng 30(1):1–12

    MATH  Google Scholar 

  5. Yoneda K, Wada I, Haruki K (1992) Job shop configuration with queueing networks and simulated annealing. Proceedings of the IEEE international conference on systems engineering, pp 407–410

  6. Bretthauer KM (1996) Capacity planning in manufacturing and computer networks. Eur J Oper Res 91:386–394

    Article  MATH  Google Scholar 

  7. Connors DP, Feigin GE, Yao D (1996) A queueing network model for semiconductor manufacturing. IEEE Trans Semicond Manuf 9(3):412–427

    Google Scholar 

  8. Swaminathan JM (2000) Tool capacity planning for semiconductor fabrication facilities under demand uncertainty. Eur J Oper Res 120:545–558

    Article  MATH  Google Scholar 

  9. Bethke AD (1981) Genetic algorithm as function optimizers. Dissertation, University of Michigan

  10. Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York

  11. Winston PH (1992) Artificial intelligence. Addison-Wesley, Boston

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Muh-Cherng Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, MC., Hsiung, Y. & Hsu, HM. Tool planning in the scenario of multiple existing semiconductor fabs. Int J Adv Manuf Technol 27, 145–151 (2005). https://doi.org/10.1007/s00170-004-2152-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-004-2152-1

Keywords

Navigation