.png){kind=icon}
返回
Semiconductor lot allocation using robust optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2010.01.021.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Semiconductor supply chain
Lot assignment
Uncertainty modeling
Robust optimization
Generalized Benders
Branch-and-price
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
On optimal sample checkpoint for energy efficient cooperative spectrum sensing能量高效协作频谱感知的最优采样检查点研究
PREAI
分享收藏Coordinating supply chains with competition: Capacity allocation in semiconductor manufacturing
PREAI
分享收藏Xp22.33p22.12 Duplication in a Patient with Intellectual Disability and Dysmorphic Facial Features
OAAI
OAAI分享收藏
查看更多内容