Semiconductor lot allocation using robust optimization
type: Item
instance of: scholarly article
title: Semiconductor lot allocation using robust optimization
zbMATH Open document ID: 1188.90015
author: B. E. Eshmatov
published in: European Journal of Operational Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 5720346
zbMATH Keywords: semiconductor supply chain
zbMATH Keywords: lot assignment
zbMATH Keywords: uncertainty modeling
zbMATH Keywords: robust optimization
zbMATH Keywords: generalized benders
zbMATH Keywords: branch-and-price
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.01.021
OpenAlex ID: W2045911414
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Robust convex optimization
cites work: The Price of Robustness
cites work: Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing
cites work: The Allocation of Inventory Risk in a Supply Chain: Push, Pull, and Advance-Purchase Discount Contracts
cites work: Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance
cites work: Capacity Allocation Using Past Sales: When to Turn-and-Earn
cites work: Bin covering algorithms in the second stage of the lot to order matching problem
cites work: Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
cites work: Q4198056
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Information Distortion in a Supply Chain: The Bullwhip Effect
cites work: Coordinating supply chains with competition: capacity allocation in semiconductor manu\-facturing
cites work: Q5442489
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
DOI: 10.1016/J.EJOR.2010.01.021
Recommended article: Robust capacity planning in semiconductor manufacturing
Recommended article: Allocation of Chips to Wafers in a Production Problem of Semiconductor Kits
Recommended article: Robust optimization for lot-sizing problems under yield uncertainty
Recommended article: Robust production capacity planning under uncertain wafer lots transfer probabilities for semiconductor automated material handling systems
Recommended article: Capacity allocation with machine duplication in semiconductor manufacturing
Recommended article: An optimization approach to capacity expansion in semiconductor manufacturing facilities
Recommended article: Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
Recommended article: An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
Recommended article: A robust lot sizing problem with ill-known demands
Recommended article: An optimised dynamic bottleneck dispatching policy for semiconductor wafer fabrication
description: scientific article; zbMATH DE number 5720346