IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v205y2010i3p557-570.html
   My bibliography  Save this article

Semiconductor lot allocation using robust optimization

Author

Listed:
  • Ng, Tsan Sheng
  • Sun, Yang
  • Fowler, John

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.

Suggested Citation

  • Ng, Tsan Sheng & Sun, Yang & Fowler, John, 2010. "Semiconductor lot allocation using robust optimization," European Journal of Operational Research, Elsevier, vol. 205(3), pages 557-570, September.
  • Handle: RePEc:eee:ejores:v:205:y:2010:i:3:p:557-570
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00029-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gérard P. Cachon & Martin A. Lariviere, 1999. "Capacity Allocation Using Past Sales: When to Turn-and-Earn," Management Science, INFORMS, vol. 45(5), pages 685-703, May.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Gérard P. Cachon, 2004. "The Allocation of Inventory Risk in a Supply Chain: Push, Pull, and Advance-Purchase Discount Contracts," Management Science, INFORMS, vol. 50(2), pages 222-238, February.
    4. Mallik, Suman & Harker, Patrick T., 2004. "Coordinating supply chains with competition: Capacity allocation in semiconductor manufacturing," European Journal of Operational Research, Elsevier, vol. 159(2), pages 330-347, December.
    5. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    6. Gérard P. Cachon & Martin A. Lariviere, 1999. "Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance," Management Science, INFORMS, vol. 45(8), pages 1091-1108, August.
    7. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    8. M Carlyle & K Knutson & J Fowler, 2001. "Bin covering algorithms in the second stage of the lot to order matching problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(11), pages 1232-1243, November.
    9. Hau L. Lee & V. Padmanabhan & Seungjin Whang, 1997. "Information Distortion in a Supply Chain: The Bullwhip Effect," Management Science, INFORMS, vol. 43(4), pages 546-558, April.
    10. Zuo-Jun Max Shen & Collette Coullard & Mark S. Daskin, 2003. "A Joint Location-Inventory Model," Transportation Science, INFORMS, vol. 37(1), pages 40-55, February.
    11. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    2. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    3. Beraudy, Sébastien & Absi, Nabil & Dauzère-Pérès, Stéphane, 2022. "Timed route approaches for large multi-product multi-step capacitated production planning problems," European Journal of Operational Research, Elsevier, vol. 300(2), pages 602-614.
    4. Gorissen, Bram L. & den Hertog, Dick, 2013. "Robust counterparts of inequalities containing sums of maxima of linear functions," European Journal of Operational Research, Elsevier, vol. 227(1), pages 30-43.
    5. Gorissen, B.L. & den Hertog, D., 2011. "Robust Counterparts of Inequalities Containing Sums of Maxima of Linear Functions," Other publications TiSEM 8c6aa0e2-c4c6-4693-ab9a-f, Tilburg University, School of Economics and Management.
    6. Gorissen, B.L. & den Hertog, D., 2011. "Robust Counterparts of Inequalities Containing Sums of Maxima of Linear Functions," Discussion Paper 2011-115, Tilburg University, Center for Economic Research.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. İsmail Bakal & Nesim Erkip & Refik Güllü, 2011. "Value of supplier’s capacity information in a two-echelon supply chain," Annals of Operations Research, Springer, vol. 191(1), pages 115-135, November.
    2. Yefen Chen & Xuanming Su & Xiaobo Zhao, 2012. "Modeling Bounded Rationality in Capacity Allocation Games with the Quantal Response Equilibrium," Management Science, INFORMS, vol. 58(10), pages 1952-1962, October.
    3. Nicholas G. Hall & Zhixin Liu, 2010. "Capacity Allocation and Scheduling in Supply Chains," Operations Research, INFORMS, vol. 58(6), pages 1711-1725, December.
    4. Geng, Qin & Mallik, Suman, 2007. "Inventory competition and allocation in a multi-channel distribution system," European Journal of Operational Research, Elsevier, vol. 182(2), pages 704-729, October.
    5. Hau L. Lee & V. Padmanabhan & Seungjin Whang, 2004. "Comments on "Information Distortion in a Supply Chain: The Bullwhip Effect"," Management Science, INFORMS, vol. 50(12_supple), pages 1887-1893, December.
    6. Ng, T.S. & Lee, L.H. & Chew, E.P., 2006. "Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1117-1140, December.
    7. Thomas C. Sharkey & Joseph Geunes & H. Edwin Romeijn & Zuo‐Jun Max Shen, 2011. "Exact algorithms for integrated facility location and production planning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(5), pages 419-436, August.
    8. Pishchulov, Grigory & Richter, Knut, 2009. "Inventory rationing and sharing in pre-sell distribution with mobile communication technologies," International Journal of Production Economics, Elsevier, vol. 121(2), pages 584-600, October.
    9. Cai, Xueyuan & Li, Jianbin & Lian, Zhaotong & Liu, Zhixin, 2022. "Fixed allocation of capacity for multiple retailers under demand competition," Omega, Elsevier, vol. 110(C).
    10. Feng, Bo & Li, Yanzhi & Shen, Huaxiao, 2015. "Tying mechanism for airlines’ air cargo capacity allocation," European Journal of Operational Research, Elsevier, vol. 244(1), pages 322-330.
    11. Anand Paul & Tharanga Rajapakshe & Suman Mallik, 2019. "Socially Optimal Contracting between a Regional Blood Bank and Hospitals," Production and Operations Management, Production and Operations Management Society, vol. 28(4), pages 908-932, April.
    12. Albert Y. Ha, 2001. "Supplier‐buyer contracting: Asymmetric cost information and cutoff level policy for buyer participation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(1), pages 41-64, February.
    13. Alper Atamtürk & Andrés Gómez, 2020. "Submodularity in Conic Quadratic Mixed 0–1 Optimization," Operations Research, INFORMS, vol. 68(2), pages 609-630, March.
    14. Mallik, Suman, 2007. "Contracting over multiple parameters: Capacity allocation in semiconductor manufacturing," European Journal of Operational Research, Elsevier, vol. 182(1), pages 174-193, October.
    15. Ho-Yin Mak & Ying Rong & Zuo-Jun Max Shen, 2013. "Infrastructure Planning for Electric Vehicles with Battery Swapping," Management Science, INFORMS, vol. 59(7), pages 1557-1575, July.
    16. Soo-Haeng Cho & Christopher S. Tang, 2014. "Technical Note---Capacity Allocation Under Retail Competition: Uniform and Competitive Allocations," Operations Research, INFORMS, vol. 62(1), pages 72-80, February.
    17. Qiang Gong, 2008. "Optimal Buy-Back Contracts with Asymmetric Information," International Journal of Management and Marketing Research, The Institute for Business and Finance Research, vol. 1(1), pages 23-47.
    18. Jianbin Li & Niu Yu & Zhixin Liu & Xueyuan Cai, 2017. "Allocation with demand competition: Uniform, proportional, and lexicographic mechanisms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(2), pages 85-107, March.
    19. Lauren Xiaoyuan Lu & Martin A. Lariviere, 2012. "Capacity Allocation over a Long Horizon: The Return on Turn-and-Earn," Manufacturing & Service Operations Management, INFORMS, vol. 14(1), pages 24-41, January.
    20. Ying Rong & Lawrence V. Snyder & Zuo‐Jun Max Shen, 2017. "Bullwhip and reverse bullwhip effects under the rationing game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 203-216, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:205:y:2010:i:3:p:557-570. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.