需求不確定下tft-lcd產業隨機產能規劃.pptVIP

* * * * * * * * * * * * * * * * * * * * Two-Stage Stochastic Programming Model of Multi-Site Capacity Planning - Notation Two-Stage Stochastic Programming Model of Multi-Site Capacity Planning - Objective Function Objective Function - maximize expected total net profits Expected Total Revenue Expected Total Production Cost Expected Total Inventory Cost Total Expansion Cost First-Stage Objective Second-Stage Objective Two-Stage Stochastic Programming Model of Multi-Site Capacity Planning - Constraints First-Stage Constraints (non-scenario related) Two-Stage Stochastic Programming Model of Multi-Site Capacity Planning - Constraints Second-Stage Constraints (scenario related) Connector between capacity allocation and expansion problems!!! Expected Shadow-Price based Decomposition- Scenario-dependent capacity allocation phase Without considering capacity expansion decision, our stochastic mixed integer programming model becomes the linear programming-based stochastic multi-site capacity allocation model (SMSCA) below. Since the stochastic multi-site capacity allocation problem is a large-scale linear programming model with the huge number of demand scenarios, we can decompose this whole model into a number of capacity allocation sub-models with individual demand scenario. Industry Practice and Model Validation- Numerical Study and Model Robustness In order to show the robustness of solution generated by two-stage stochastic programming, we conduct detailed numerical study to compare the solution robustness between the two-stage stochastic programming model (SP model) and the deterministic model using expected forecast demands (EV model). A set of sample data includes two Array sites, five product groups, six months and three demand scenarios (low, medium and high demand) is collected from TFT-LCD industry partners. Robust auxiliary tool purchasing plan in SP model Auxiliary tool purchasing plan in EV model Industry Practice and Model Validation