TY - GEN
T1 - Semiconductor production planning using robust optimization
AU - Ng, T. S.
AU - Fowler, John
PY - 2007/12/1
Y1 - 2007/12/1
N2 - We considera semiconductor chip production planning problem, where chips with different performance characteristics are produced from the same wafer supply simultaneously. Due to long production cycle times, decisions on the wafer production need to be executed prior to knowing the demands and binning information exactly. Once this information is realized, assignment decisions are then executed to allocate the available production to satisfy the demands. Furthermore, product substitution is allowed in the allocation. To address the issue of data uncertainty in the planning process, in this work we propose to use the robust optimization approach to develop a new planning model for the problem. Our model is based on a two-stage robust network flow problem, and we demonstrate that by using our proposed model, we are able to achieve production plans that can hedge against the random variations in the data without over-sacrificing the solution quality. Furthermore, the robust optimization models require limited distributional assumptions and result in linear programming counterpart problems, which can be solved efficiently using commercial solvers.
AB - We considera semiconductor chip production planning problem, where chips with different performance characteristics are produced from the same wafer supply simultaneously. Due to long production cycle times, decisions on the wafer production need to be executed prior to knowing the demands and binning information exactly. Once this information is realized, assignment decisions are then executed to allocate the available production to satisfy the demands. Furthermore, product substitution is allowed in the allocation. To address the issue of data uncertainty in the planning process, in this work we propose to use the robust optimization approach to develop a new planning model for the problem. Our model is based on a two-stage robust network flow problem, and we demonstrate that by using our proposed model, we are able to achieve production plans that can hedge against the random variations in the data without over-sacrificing the solution quality. Furthermore, the robust optimization models require limited distributional assumptions and result in linear programming counterpart problems, which can be solved efficiently using commercial solvers.
KW - Co-production processes
KW - Robust optimization
UR - http://www.scopus.com/inward/record.url?scp=40649094778&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=40649094778&partnerID=8YFLogxK
U2 - 10.1109/IEEM.2007.4419357
DO - 10.1109/IEEM.2007.4419357
M3 - Conference contribution
AN - SCOPUS:40649094778
SN - 1424415292
SN - 9781424415298
T3 - IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management
SP - 1073
EP - 1077
BT - IEEM 2007
T2 - 2007 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2007
Y2 - 2 December 2007 through 4 December 2007
ER -