IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v273y2024ics0925527324001208.html
   My bibliography  Save this article

A quantitative framework to support the decision between traditional, selective, and hybrid assembly

Author

Listed:
  • Mencaroni, Andrea
  • Claeys, Dieter
  • Raa, Birger
  • De Vuyst, Stijn

Abstract

High-technological products often consist of several components, each with varying feature values that are critical to the assembly’s quality. As traditional manufacturing involves random selection of components, strict tolerance ranges are typically set to limit their feature variability, increasing scrap rates and lowering material efficiency. By smartly combining components based on their measured features, selective and hybrid assembly allow for more relaxed tolerances and more efficient use of raw materials without affecting the final product’s quality. However, the increased logistical complexity involves additional operational costs, complicating the choice for the best strategy.

Suggested Citation

  • Mencaroni, Andrea & Claeys, Dieter & Raa, Birger & De Vuyst, Stijn, 2024. "A quantitative framework to support the decision between traditional, selective, and hybrid assembly," International Journal of Production Economics, Elsevier, vol. 273(C).
    • Handle: RePEc:eee:proeco:v:273:y:2024:i:c:s0925527324001208
    DOI: 10.1016/j.ijpe.2024.109263
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527324001208
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2024.109263?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
    ---><---

    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. 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.
    2. Timothy L. Urban, 2022. "Component ordering policies for selective assembly," International Journal of Production Research, Taylor & Francis Journals, vol. 60(5), pages 1520-1534, March.
    3. Matthias Tan & C. Wu, 2012. "Generalized selective assembly," IISE Transactions, Taylor & Francis Journals, vol. 44(1), pages 27-42.
    4. Abolfazl Rezaei Aderiani & Kristina Wärmefjord & Rikard Söderberg & Lars Lindkvist, 2019. "Developing a selective assembly technique for sheet metal assemblies," International Journal of Production Research, Taylor & Francis Journals, vol. 57(22), pages 7174-7188, November.
    5. Mencaroni, Andrea & Claeys, Dieter & De Vuyst, Stijn, 2023. "A novel hybrid assembly method to reduce operational costs of selective assembly," International Journal of Production Economics, Elsevier, vol. 264(C).
    6. William P. Pierskalla, 1968. "Letter to the Editor—The Multidimensional Assignment Problem," Operations Research, INFORMS, vol. 16(2), pages 422-431, April.
    7. C.R. Coullard & A.B. Gamble & P.C. Jones, 1998. "Matching problems in selective assembly operations," Annals of Operations Research, Springer, vol. 76(0), pages 95-107, January.
    8. Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.
    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. Mencaroni, Andrea & Claeys, Dieter & De Vuyst, Stijn, 2023. "A novel hybrid assembly method to reduce operational costs of selective assembly," International Journal of Production Economics, Elsevier, vol. 264(C).
    2. 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.
    3. 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.
    4. 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.
    5. Ortega, Josué & Klein, Thilo, 2022. "Improving Efficiency and Equality in School Choice," QBS Working Paper Series 2022/02, Queen's University Belfast, Queen's Business School.
    6. Kammerdiner, A.R. & Pasiliao, E.L., 2014. "In and out forests on combinatorial landscapes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 78-84.
    7. Benjamin Lev, 2010. "Book Reviews," Interfaces, INFORMS, vol. 40(6), pages 480-485, December.
    8. Duc Manh Nguyen & Hoai An Le Thi & Tao Pham Dinh, 2014. "Solving the Multidimensional Assignment Problem by a Cross-Entropy method," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 808-823, May.
    9. Mădălina M. Drugan, 2015. "Generating QAP instances with known optimum solution and additively decomposable cost function," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1138-1172, November.
    10. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    11. Mordant, Gilles & Segers, Johan, 2021. "Maxima and near-maxima of a Gaussian random assignment field," Statistics & Probability Letters, Elsevier, vol. 173(C).
    12. Don A. Grundel & Pavlo A. Krokhmal & Carlos A. S. Oliveira & Panos M. Pardalos, 2007. "On the number of local minima for the multidimensional assignment problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 1-18, January.
    13. H-J Bandelt & A Maas & F C R Spieksma, 2004. "Local search heuristics for multi-index assignment problems with decomposable costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 694-704, July.
    14. Alla R. Kammerdiner & Andre N. Guererro, 2019. "Data-driven combinatorial optimization for sensor-based assessment of near falls," Annals of Operations Research, Springer, vol. 276(1), pages 137-153, May.
    15. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
    16. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    17. A Ghoniem & H D Sherali, 2011. "Set partitioning and packing versus assignment formulations for subassembly matching problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 2023-2033, November.
    18. Maurice Queyranne & Frits Spieksma & Fabio Tardella, 1998. "A General Class of Greedily Solvable Linear Programs," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 892-908, November.
    19. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
    20. Panayotis Mertikopoulos & Heinrich H. Nax & Bary S. R. Pradelski, 2019. "Quick or cheap? Breaking points in dynamic markets," ECON - Working Papers 338, Department of Economics - University of Zurich.

    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:proeco:v:273:y:2024:i:c:s0925527324001208. 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/ijpe .

    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.