Semiconductor lot allocation using robust optimization
From MaRDI portal
Recommendations
- Robust capacity planning in semiconductor manufacturing
- Allocation of Chips to Wafers in a Production Problem of Semiconductor Kits
- Robust optimization for lot-sizing problems under yield uncertainty
- Robust production capacity planning under uncertain wafer lots transfer probabilities for semiconductor automated material handling systems
- Capacity allocation with machine duplication in semiconductor manufacturing
- An optimization approach to capacity expansion in semiconductor manufacturing facilities
- Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- A robust lot sizing problem with ill-known demands
- An optimised dynamic bottleneck dispatching policy for semiconductor wafer fabrication
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Benders decomposition approach to robust mixed integer programming
- Bin covering algorithms in the second stage of the lot to order matching problem
- Branch-and-price: Column generation for solving huge integer programs
- Capacity Allocation Using Past Sales: When to Turn-and-Earn
- Capacity choice and allocation: strategic behavior and supply chain performance
- Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
- Coordinating supply chains with competition: capacity allocation in semiconductor manu\-facturing
- Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing
- Information Distortion in a Supply Chain: The Bullwhip Effect
- Robust convex optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The allocation of inventory risk in a supply chain: push, pull, and advance-purchase discount contracts
Cited in
(9)- Timed route approaches for large multi-product multi-step capacitated production planning problems
- A rolling horizon planning approach for short-term demand supply matching
- Allocation of Chips to Wafers in a Production Problem of Semiconductor Kits
- Recent advances in robust optimization: an overview
- Shortest path network interdiction with asymmetric uncertainty
- Incorporating contractual arrangements in production planning
- Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times
- Robust optimization for a steel production planning problem with uncertain demand and product substitution
- Bin covering algorithms in the second stage of the lot to order matching problem
This page was built for publication: Semiconductor lot allocation using robust optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976354)
