Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/103677 
Year of Publication: 
2009
Citation: 
[Journal:] BuR - Business Research [ISSN:] 1866-8658 [Volume:] 2 [Issue:] 1 [Publisher:] VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research [Place:] Göttingen [Year:] 2009 [Pages:] 86-106
Publisher: 
VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research, Göttingen
Abstract: 
Component commonality - the use of the same version of a component across multiple products - is being increasingly considered as a promising way to offer high external variety while retaining low internal variety in operations. However, increasing commonality has both positive and negative cost effects, so that optimization approaches are required to identify an optimal commonality level. As components influence to a greater or lesser extent nearly every process step along the supply chain, it is not surprising that a multitude of diverging commonality problems is being investigated in literature, each of which are developing a specific algorithm designed for the respective commonality problem being considered. The paper on hand aims at a general framework which is flexible and efficient enough to be applied to a wide range of commonality problems. Such a procedure based on a two-stage graph approach is presented and tested. Finally, flexibility of the procedure is shown by customizing the framework to account for different types of commonality problems.
Subjects: 
component-commonality
graph approach
optimization
product variety
Persistent Identifier of the first edition: 
Document Type: 
Article

Files in This Item:
File
Size
4.03 MB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.