Reserve requirements promote reliability by ensuring resources are available to rebalance the power system following random disturbances. However, reliability is not guaranteed when dispatch is limited by transmission constraints. In this work, we propose a modified form of reserve requirement that identifies response sets for distinct contingency scenarios. The approach disqualifies reserve from counting towards a particular scenario if transmission constraints are likely to render that reserve undeliverable. A decomposition algorithm for security-constrained unit commitment dynamically updates the response sets to address changing conditions. Testing on the RTS 96 test case demonstrates the approach applied in tandem with existing reserve policies to avoid situations where reserve is not deliverable due to transmission constraints. Operational implications of the proposed method are discussed.

In order to process a product in a semiconductor back-end facility, a machine needs to be qualified, first by having product-specific software installed and then running test wafers through it to verify that the machine is capable of performing the process correctly. In general, not all machines are qualified to process all products due to the high machine qualification cost and tool set availability. The machine qualification decision affects future capacity allocation in the facility and subsequently affects daily production schedules. To balance the tradeoff between current machine qualification costs and future potential backorder costs due to not enough machines qualified with uncertain demand, a stochastic product–machine qualification optimization model is proposed in this article. The L-shaped method and acceleration techniques are proposed to solve the stochastic model. Computational results are provided to show the necessity of the stochastic model and the performance of different solution methods.