Constraint-driven exact algorithm for the manufacturing cell formation problem Online publication date: Mon, 25-Jan-2016
by Sabrina Merchichi; Menouar Boulif
European J. of Industrial Engineering (EJIE), Vol. 9, No. 6, 2015
Abstract: This paper deals with the manufacturing cell formation (MCF) problem, which is based on group technology (GT) principles, by using a graph-theoretic model. Due to the exponential nature of the problem, various heuristics and meta-heuristics have been proposed to solve it. However, only few studies have attempted to develop exact algorithms. In this paper, we develop two B&B algorithms, taking into account the actual constraints of production. The first algorithm is based on the notion of co-cycles (cuts) in the generation of solutions. The second has a similar structure, except that it is improved by using the constraints. The obtained results of the two algorithms are reported for medium-sized instances. [Received 6 December 2013; Revised 10 March 2014; Accepted 3 August 2014]
Online publication date: Mon, 25-Jan-2016
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 European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and 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 email@example.com