Robust capacity planning in semiconductor manufacturing
We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely,...
Saved in:
Published in | Naval research logistics Vol. 52; no. 5; pp. 459 - 468 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Hoboken
Wiley Subscription Services, Inc., A Wiley Company
01.08.2005
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. |
---|---|
Bibliography: | istex:9B62341FE4F6C7BBEA1CD7ACEFBAB021C272DDD4 ArticleID:NAV20086 ark:/67375/WNG-6280WLV9-T |
ISSN: | 0894-069X 1520-6750 |
DOI: | 10.1002/nav.20086 |