Semiconductor lot allocation using robust optimization

DOI10.1016/j.ejor.2010.01.021zbMath1188.90015OpenAlexW2045911414MaRDI QIDQ976354

B. E. Eshmatov

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.021

zbMATH Keywords

robust optimizationbranch-and-priceuncertainty modelinggeneralized benderslot assignmentsemiconductor supply chain

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items (4)

Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times ⋮ Shortest path network interdiction with asymmetric uncertainty ⋮ Recent advances in robust optimization: an overview ⋮ Timed route approaches for large multi-product multi-step capacitated production planning problems

Cites Work

• Unnamed Item
• Unnamed Item
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Coordinating supply chains with competition: capacity allocation in semiconductor manu\-facturing
• Robust Convex Optimization
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• The Allocation of Inventory Risk in a Supply Chain: Push, Pull, and Advance-Purchase Discount Contracts
• Capacity Allocation Using Past Sales: When to Turn-and-Earn
• Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• A Linear Programming Approach to the Cutting-Stock Problem
• Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing
• The Price of Robustness
• Information Distortion in a Supply Chain: The Bullwhip Effect
• Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
• Bin covering algorithms in the second stage of the lot to order matching problem
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Semiconductor lot allocation using robust optimization