SHI-CHUNG CHANGSu, S.-S.S.-S.SuChen, K.-J.K.-J.Chen2018-09-102018-09-10200808917736http://www.scopus.com/inward/record.url?eid=2-s2.0-60749085925&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/341133https://www.scopus.com/inward/record.uri?eid=2-s2.0-60749085925&doi=10.1109%2fWSC.2008.4736327&partnerID=40&md5=8f68267a52bd692eb62d28f76cf9c8a6Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. This paper studies a priority mix planning (PMP) problem that determines the wafer release rates of individual priorities to maximize fab profit subject to XFT and capacity constraints. It is formulated as a nonlinear programming problem, where the constraints integrate an extended M/G/m:PR queue approximation with contribution theory-based network for modeling how Xfactors of individual priorities are affected by priority mix and fab capacity utilization. It is then demonstrated over a realistic fab example that PMP problem can be solved for effectively planning priority mix and machine tool capacity utilization to provide cycle-time differentiated manufacturing services. ©2008 IEEE.[SDGs]SDG9Capacity constraints; Capacity utilizations; Cycle time; Fab capacities; Fab productions; Manufacturing services; Non-linear programming problems; Release rates; Semiconductor fabs; Semiconductor manufacturing; Machinery; Semiconductor materials; Electric conductivityconference paper10.1109/WSC.2008.47363272-s2.0-60749085925