.png){kind=icon}
Return
Semiconductor lot allocation using robust optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2010.01.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work, the problem of allocating a set of production lots to satisfy customer orders is considered. This research is of relevance to lot-to-order matching problems in semiconductor supply chain settings. We consider that lot-splitting is not allowed during the allocation process due to standard practices. Furthermore, lot-sizes are regarded as uncertain planning data when making the allocation decisions due to potential yield loss. In order to minimize the total penalties of demand un-fulfillment and over-fulfillment, a robust mixed-integer optimization approach is adopted to model is proposed the problem of allocating a set of work-in-process lots to customer orders, where lot-sizes are modeled using ellipsoidal uncertainty sets. To solve the optimization problem efficiently we apply the techniques of branch-and-price and Benders decomposition. The advantages of our model are that it can represent uncertainty in a straightforward manner with little distributional assumptions, and it can produce solutions that effectively hedge against the uncertainty in the lot-sizes using very reasonable amounts of computational effort. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Semiconductor supply chain
Lot assignment
Uncertainty modeling
Robust optimization
Generalized Benders
Branch-and-price
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations
Cited Papers
.png){kind=icon}
Coordinating supply chains with competition: Capacity allocation in semiconductor manufacturing
PREAI
ShareSaveXp22.33p22.12 Duplication in a Patient with Intellectual Disability and Dysmorphic Facial Features
OAAI
OAAIShareSaveShareSave View more