A branch-and-bound algorithm for the cell formation problem

Abstract The Cell Formation Problem (CFP) is an important optimisation problem in manufacturing. It has been introduced in the Group Technology (GT) and its goal is to group machines and parts processed on them into production cells minimising the movement of parts to other cells for processing and maximising for each cell the loading of its machines with operations on its parts. We consider one of the computationally hardest formulations of this problem – the CFP with a variable number of cells and the grouping efficacy objective, which is a fractional function. The CFP literature contains many heuristic algorithms, but only a small number of exact approaches especially for this formulation. In the current paper, we present an exact branch-and-bound algorithm for the same hard CFP formulation. To linearise the fractional objective function, we apply the Dinkelbach approach. We have been able to solve 24 of the 35 instances from the well known GT benchmark. For the remaining 11 instances, the difference in the grouping efficacy with the best known solutions is less than 2.6%.

[1]  Warren J. Boe,et al.  A close neighbour algorithm for designing cellular manufacturing systems , 1991 .

[2]  Panos M. Pardalos,et al.  Pareto-optimal front of cell formation problem in group technology , 2014, Journal of Global Optimization.

[3]  I. Stancu-Minasian.  Nonlinear Fractional Programming , 1997 .

[4]  M. Brusco.  An exact algorithm for maximizing grouping efficacy in part–machine clustering , 2015 .

[5]  Samuel Eilon.  A new approach to production control , 1958 .

[6]  Mauricio G. C. Resende,et al.  An evolutionary algorithm for manufacturing cell formation , 2004, Comput. Ind. Eng..

[7]  Cynthia A. Phillips,et al.  PEBBL: an object-oriented framework for scalable parallel branch and bound , 2015, Mathematical Programming Computation.

[8]  Paolo Toth,et al.  Algorithms and codes for dense assignment problems: the state of the art , 2000, Discret. Appl. Math..

[9]  M. Chandrasekharan,et al.  MODROC: an extension of rank order clustering for group technology , 1986 .

[10]  Panos M. Pardalos,et al.  Biclustering in data mining , 2008, Comput. Oper. Res..

[11]  P. Waghodekar,et al.  Machine-component cell formation in group technology: MACE , 1984 .

[12]  A. Kusiak,et al.  Efficient solving of the group technology problem , 1987 .

[13]  Larry R. Taube,et al.  The facets of group technology and their impacts on implementation--A state-of-the-art survey , 1985 .

[14]  Mohammad Mahdi Paydar,et al.  A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy , 2013, Comput. Oper. Res..

[15]  M. Chandrasekharan,et al.  Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology , 1990 .

[16]  Harold J. Steudel,et al.  A within-cell utilization based heuristic for designing cellular manufacturing systems , 1987 .

[17]  Larry E. Stanfel,et al.  Machine clustering for economic production , 1985 .

[18]  Philip M. Wolfe,et al.  Application of the Similarity Coefficient Method in Group Technology , 1986 .

[19]  Warren J. Boe,et al.  DESIGNING CELLULAR MANUFACTURING SYSTEMS: BRANCH-AND-BOUND AND A∗ APPROACHES , 1993 .

[20]  M. Chandrasekharan,et al.  GROUPABIL1TY: an analysis of the properties of binary data matrices for group technology , 1989 .

[21]  Andrew Kusiak,et al.  Grouping of parts and components in flexible manufacturing systems , 1986 .

[22]  J. King.  Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm , 1980 .

[23]  Larry R. Taube,et al.  Weighted similarity measure heuristics for the group technology machine clustering problem , 1985 .

[24]  Allan S. Carrie,et al.  Numerical taxonomy applied to group technology and plant layout , 1973 .

[25]  Irina Utkina,et al.  A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem , 2016, DOOR.

[26]  Irina Utkina,et al.  A Branch and Bound Algorithm for the Cell Formation Problem , 2014 .

[27]  T. Narendran,et al.  An assignment model for the part-families problem in group technology , 1990 .

[28]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[29]  J. King,et al.  Machine-component group formation in group technology: review and extension , 1982 .

[30]  Michael J. Brusco,et al.  An iterated local search heuristic for cell formation , 2015, Comput. Ind. Eng..

[31]  M. Chandrasekharan,et al.  An ideal seed non-hierarchical clustering algorithm for cellular manufacturing , 1986 .

[32]  J. Arkat,et al.  A new branch and bound algorithm for cell formation problem , 2012 .

[33]  D. A. Milner,et al.  Direct clustering algorithm for group formation in cellular manufacture , 1982 .

[34]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[35]  M. Chandrasekharan,et al.  ZODIAC—an algorithm for concurrent formation of part-families and machine-cells , 1987 .

[36]  John L. Burbidge,et al.  The "new approach" to production , 1961 .

[37]  Hamid Seifoddini,et al.  A note on the similarity coefficient method and the problem of improper machine assignment in group technology applications , 1989 .

[38]  A. Kusiak.  The generalized group technology concept , 1987 .

[39]  S. Sofianopoulou,et al.  An optimal tree search method for the manufacturing systems cell formation problem , 1998, Eur. J. Oper. Res..

[40]  Jacques A. Ferland,et al.  An exact method for solving the manufacturing cell formation problem , 2012 .

[41]  Panos M. Pardalos,et al.  Exact model for the cell formation problem , 2014, Optim. Lett..

[42]  Tabitha L. James,et al.  A hybrid grouping genetic algorithm for the cell formation problem , 2007, Comput. Oper. Res..

[43]  Irina Utkina,et al.  A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem , 2016 .

[44]  Panos M. Pardalos,et al.  Heuristic Algorithm for the Cell Formation Problem , 2013 .

[45]  Anthony Vannelli,et al.  Strategic subcontracting for efficient disaggregated manufacturing , 1986 .

[46]  F. Boctor.  A Jinear formulation of the machine-part cell formation problem , 1991 .

[47]  Ronald G. Asktn,et al.  A cost-based heuristic for group technology configuration† , 1987 .