Please use this identifier to cite or link to this item:
|Title:||Semantic modeling and extraction for cross-family product configuration|
Constraint Satisfaction Problem (CSP)
Cross family product configuration
|Source:||Huang, Y.,Ng, W.K.,Liu, H.,Lu, W.,Song, B.,Li, X. (2007). Semantic modeling and extraction for cross-family product configuration. Proceedings - ICSSSM'07: 2007 International Conference on Service Systems and Service Management : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ICSSSM.2007.4280186|
|Abstract:||In today's global marketplace, customers' demand for personalized product has become a trend. This results in an increasing demand for manufacturers to produce more product variants. Product configurator as an integral part of manufacturing services system plays an important role in generating and managing product variants. In order for product configurator to generate as much variety as possible for the market with as little variety as possible inbetween products, we introduce a cross family product configuration concept for generating more product variants on-the-fly without designing a new product family. A Constraint Satisfaction Problem (CSP) approach is adopted to model the configuration problem. We define a novel way of semantic modeling to capture the configuration knowledge for a product family, including product family composition information, configuration constraints and their mapping relationship. Based on the model, a semantics extraction algorithm is proposed to extract useful semantics from existing product family knowledge for cross family product configuration. The significance of the model and extraction approach is demonstrated. © 2007 IEEE.|
|Source Title:||Proceedings - ICSSSM'07: 2007 International Conference on Service Systems and Service Management|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.