Multi-objective cell formation with routing flexibility: a graph partitioning approach
by Menouar Boulif; Karim Atif
International Journal of Computational Science and Engineering (IJCSE), Vol. 11, No. 2, 2015

Abstract: This paper deals with the manufacturing cell formation (MCF) problem using a multi-objective graph-theoretic approach. In cellular manufacturing related recent works, several research paths have been taken such as the multi-periodic and the routing flexibility approaches. Our paper falls into the latter by proposing a multi-objective approach. First, the problem is formulated using a graph theoretic model, afterwards two resolution methods are proposed: the first one is a genetic algorithm (GA) whereas the second uses a combination between GA and tabu search. The two methods are applied on a set of medium-sized instances and the obtained results are reported.

Online publication date: Tue, 22-Sep-2015

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 Computational Science and Engineering (IJCSE):
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