Chaining set partitions with applications in manufacturing system configuration planning

Ningjian Huang and Yhu-Tin Lin

International Journal of Operational Research, 2009, vol. 6, issue 3, 380-404

Abstract: Knowing the number of candidate configurations is the first and critical step in manufacturing system configuration planning because it determines the methods for subsequent optimisation tasks. However, counting the total number of candidate configurations is a challenging partitioning problem due to the multiple sets of work elements that are often chained by the overlapping elements between adjacent sets. Starting with simple partitioning scenarios, this paper presents a new mathematical treatment and derives the formulas for calculating the number of candidate system configurations, which can eventually lead to algorithms for system configuration selection, simulation and optimisation.

Keywords: combinatorics; chaining set partitions; manufacturing system configuration; algorithms; system configuration selection; simulation; optimisation; configuration planning. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=26939 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:6:y:2009:i:3:p:380-404

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().