Please use this identifier to cite or link to this item:
Title: Semiconductor production planning using robust optimization
Authors: Ng, T.S. 
Fowler, J.
Keywords: Co-production processes
Robust optimization
Issue Date: 2007
Citation: Ng, T.S., Fowler, J. (2007). Semiconductor production planning using robust optimization. IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management : 1073-1077. ScholarBank@NUS Repository.
Abstract: 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. © 2007 IEEE.
Source Title: IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management
ISBN: 1424415292
DOI: 10.1109/IEEM.2007.4419357
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on May 15, 2019

Page view(s)

checked on May 12, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.