Component commonality, the use of the same version of a component across multiple products, is 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 a more or less of components influences nearly every process step along the supply chain, it is not astounding that a multitude of diverging commonality problems is investigated in literature, each of which developing a specific algorithm designed for the respective commonality problem considered. The paper on hand aims at a general framework, flexible and effcient enough to be applied to a wide range of commonality problems. Such a procedure basing 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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Order Information: Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.
For technical questions regarding this item, or to correct its listing, contact: ().
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: