Abstract

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.

Original languageEnglish (US)
Pages (from-to)557-570
Number of pages14
JournalEuropean Journal of Operational Research
Volume205
Issue number3
DOIs
StatePublished - Sep 16 2010

Fingerprint

Lot Size
Robust Optimization
Semiconductors
Semiconductor materials
Uncertainty
Customers
Branch-and-price
Benders Decomposition
Matching Problem
Supply Chain
Supply chains
Penalty
Planning
Optimization Problem
Decomposition
Minimise
Integer
Optimization
Model
Lot size

Keywords

  • Branch-and-price
  • Generalized Benders
  • Lot assignment
  • Robust optimization
  • Semiconductor supply chain
  • Uncertainty modeling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Modeling and Simulation
  • Information Systems and Management

Cite this

Semiconductor lot allocation using robust optimization. / Ng, Tsan Sheng; Sun, Yang; Fowler, John.

In: European Journal of Operational Research, Vol. 205, No. 3, 16.09.2010, p. 557-570.

Research output: Contribution to journalArticle

Ng, Tsan Sheng ; Sun, Yang ; Fowler, John. / Semiconductor lot allocation using robust optimization. In: European Journal of Operational Research. 2010 ; Vol. 205, No. 3. pp. 557-570.
@article{5d26bdaef83840a98294785ebdfd9710,
title = "Semiconductor lot allocation using robust optimization",
abstract = "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.",
keywords = "Branch-and-price, Generalized Benders, Lot assignment, Robust optimization, Semiconductor supply chain, Uncertainty modeling",
author = "Ng, {Tsan Sheng} and Yang Sun and John Fowler",
year = "2010",
month = "9",
day = "16",
doi = "10.1016/j.ejor.2010.01.021",
language = "English (US)",
volume = "205",
pages = "557--570",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Semiconductor lot allocation using robust optimization

AU - Ng, Tsan Sheng

AU - Sun, Yang

AU - Fowler, John

PY - 2010/9/16

Y1 - 2010/9/16

N2 - 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.

AB - 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.

KW - Branch-and-price

KW - Generalized Benders

KW - Lot assignment

KW - Robust optimization

KW - Semiconductor supply chain

KW - Uncertainty modeling

UR - http://www.scopus.com/inward/record.url?scp=77649337551&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77649337551&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2010.01.021

DO - 10.1016/j.ejor.2010.01.021

M3 - Article

AN - SCOPUS:77649337551

VL - 205

SP - 557

EP - 570

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -