Chaining set partitions with applications in manufacturing system configuration planning
by Ningjian Huang, Yhu-Tin Lin
International Journal of Operational Research (IJOR), Vol. 6, No. 3, 2009

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.

Online publication date: Thu, 09-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com