IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v54y2024i5p404-416.html
   My bibliography  Save this article

The Sort-Assemble-Blend Routing Problem and Its Application to Semiconductors

Author

Listed:
  • A. Nicholas Mason

    (Intel Corporation, Chandler, Arizona 85226)

  • Rachel A. Rosenberg

    (Intel Corporation, Chandler, Arizona 85226)

  • Evan A. Rash

    (Intel Corporation, Chandler, Arizona 85226)

  • Karl G. Kempf

    (Intel Corporation, Chandler, Arizona 85226)

Abstract

Recent technological advances in the semiconductor industry have rapidly changed how products are designed and manufactured. Large “monolithic” designs, which integrate multiple functionalities in a single printed die, are being replaced with multidie products. To ensure the success of this transformation, it is critical to sort materials into categories and strategically build assemblies with maximum compatibility in mind. This enables manufacturing to be optimized to fulfill specific requirements for final products. However, it also means that more individual components must be managed, and decisions on how to assemble them must be made holistically. This creates a complex, nonlinear problem that combines qualities of both selective assembly and assembly routing problems. The result is named the sort-assemble-blend routing problem (SABR-P). Its solution approach is formulated using techniques including genetic algorithms, Monte Carlo simulations, linear programming, and machine learning. This framework has been successfully applied in practice, saving Intel Corporation more than $500 million thus far. It is the new standard for analyzing and optimizing Intel’s multidie products for the foreseeable future.

Suggested Citation

  • A. Nicholas Mason & Rachel A. Rosenberg & Evan A. Rash & Karl G. Kempf, 2024. "The Sort-Assemble-Blend Routing Problem and Its Application to Semiconductors," Interfaces, INFORMS, vol. 54(5), pages 404-416, September.
    • Handle: RePEc:inm:orinte:v:54:y:2024:i:5:p:404-416
    DOI: 10.1287/inte.2024.0114
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2024.0114
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2024.0114?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Matthias Tan & C. Wu, 2012. "Generalized selective assembly," IISE Transactions, Taylor & Francis Journals, vol. 44(1), pages 27-42.
    2. Fabozzi, Frank J. (ed.), 2016. "The Handbook of Mortgage-Backed Securities, 7th Edition," OUP Catalogue, Oxford University Press, edition 7, number 9780198785774.
    3. Masoud Chitsaz & Jean-François Cordeau & Raf Jans, 2019. "A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 134-152, February.
    Full references (including those not matched with items on IDEAS)

    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. Alvarez, Aldair & Miranda, Pedro & Rohmer, S.U.K., 2022. "Production routing for perishable products," Omega, Elsevier, vol. 111(C).
    2. Andreas Fuster & Aurel Hizmo & Lauren Lambie-Hanson & James Vickery & Paul S. Willen, 2021. "How Resilient Is Mortgage Credit Supply? Evidence from the COVID-19 Pandemic," Working Papers 21-4, Federal Reserve Bank of Boston.
    3. Andreas Fuster & David Lucca & James Vickery, 2023. "Mortgage-backed securities," Chapters, in: Refet S. Gürkaynak & Jonathan H. Wright (ed.), Research Handbook of Financial Markets, chapter 15, pages 331-357, Edward Elgar Publishing.
    4. Diabat, Ali & Bianchessi, Nicola & Archetti, Claudia, 2024. "On the zero-inventory-ordering policy in the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1024-1038.
    5. Habibi, Muhammad Khakim & Hammami, Ramzi & Battaia, Olga & Dolgui, Alexandre, 2024. "Simultaneous Pickup-and-Delivery Production-Routing Problem in closed-loop supply chain with remanufacturing and disassembly consideration," International Journal of Production Economics, Elsevier, vol. 273(C).
    6. Zakaria Chekoubi & Wajdi Trabelsi & Nathalie Sauer & Ilias Majdouline, 2022. "The Integrated Production-Inventory-Routing Problem with Reverse Logistics and Remanufacturing: A Two-Phase Decomposition Heuristic," Sustainability, MDPI, vol. 14(20), pages 1-30, October.
    7. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
    8. Chitsaz, Masoud & Cordeau, Jean-François & Jans, Raf, 2020. "A branch-and-cut algorithm for an assembly routing problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 896-910.
    9. Archetti, Claudia & Coelho, Leandro C. & Grazia Speranza, M., 2019. "An exact algorithm for the inventory routing problem with logistic ratio," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 96-107.
    10. Caputo, Antonio C. & Di Salvo, Girolamo, 2019. "An economic decision model for selective assembly," International Journal of Production Economics, Elsevier, vol. 207(C), pages 56-69.
    11. Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf, 2024. "The consistent vehicle routing problem with stochastic customers and demands," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    12. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    13. Tao Wu, 2024. "Exact Method for Production Hub Location," INFORMS Journal on Computing, INFORMS, vol. 36(5), pages 1287-1315, September.
    14. Archetti, Claudia & Ljubić, Ivana, 2022. "Comparison of formulations for the Inventory Routing Problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 997-1008.
    15. Schenekemberg, Cleder M. & Scarpin, Cassius T. & Pécora, José E. & Guimarães, Thiago A. & Coelho, Leandro C., 2021. "The two-echelon production-routing problem," European Journal of Operational Research, Elsevier, vol. 288(2), pages 436-449.
    16. Toyin Clottey & W. C. Benton, 2021. "On Sharing Part Dimensions Information and Its Impact on Design Tolerances In Fixed‐Bin Selective Assembly," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4089-4104, November.
    17. Skålnes, Jørgen & Ben Ahmed, Mohamed & Hvattum, Lars Magnus & Stålhane, Magnus, 2024. "New benchmark instances for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 313(3), pages 992-1014.
    18. Toyin Clottey & W. C. Benton, 2020. "Sharing Quality‐Distribution Information for the Selective Assembly of Intermediary Components in the Automotive Industry," Production and Operations Management, Production and Operations Management Society, vol. 29(1), pages 174-191, January.
    19. Zu-Jun Ma & Fei Yang & Ying Dai & Zuo-Jun Max Shen, 2021. "The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 319-335, January.
    20. Manousakis, Eleftherios G. & Kasapidis, Grigoris A. & Kiranoudis, Chris T. & Zachariadis, Emmanouil E., 2022. "An infeasible space exploring matheuristic for the Production Routing Problem," European Journal of Operational Research, Elsevier, vol. 298(2), pages 478-495.

    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:inm:orinte:v:54:y:2024:i:5:p:404-416. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.