Cell formation problem: An multithreading Tabu search for setup time optimization for limited machine magazines: A New Solution For A Classical Problem

This paper aims to present a solution for the Manufacturing Cell Formation Problem through the use of a multithreading Tabu Search that uses deterministic methods to effectively explore local optimum areas. Manufacturing Cell Formation problem involves the process of analysing parts and groups them according to their similarity. This paper aims maximize the production efficiency, by minimizing the machine setup time in a limited magazine size through the reduction of tool changes by creating clusters of parts that share machining tools and present an initial scheduling based on tool changes reduction. In order to valid the proposed algorithm, the results obtained are compared against other Tabu Search solutions proposed in the literature.

[1]  A. Kusiak,et al.  Similarity coefficient algorithms for solving the group technology problem , 1992 .

[2]  Yunfeng Wang,et al.  Genetic algorithms for integrating cell formation with machine layout and scheduling , 2007, Comput. Ind. Eng..

[3]  Asoo J. Vakharia,et al.  Cell formation in group technology: review, evaluation and directions for future research , 1998 .

[4]  Chungnan Lee,et al.  On the harmonious mating strategy through tabu search , 2003, Inf. Sci..

[5]  Ravi Kothari,et al.  Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods , 2013, Eur. J. Oper. Res..

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

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

[8]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

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

[10]  Stella Sofianopoulou,et al.  An efficient ant colony optimization system for the manufacturing cells formation problem , 2008 .

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

[12]  Nancy Lea Hyer,et al.  Cellular manufacturing in the U.S. industry: a survey of users , 1989 .

[13]  Yi He,et al.  A parallel adaptive tabu search approach for traveling salesman problems , 2005, 2005 International Conference on Natural Language Processing and Knowledge Engineering.

[14]  Christine Solnon,et al.  Reactive Tabu Search for Measuring Graph Similarity , 2005, GbRPR.

[15]  Yash P. Aneja,et al.  Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic , 2011, Comput. Oper. Res..

[16]  Michel Gendreau,et al.  A tabu search procedure for multicommodity location/allocation with balancing requirements , 1992, Ann. Oper. Res..

[17]  Chu-Sing Yang,et al.  A Time-Efficient Method for Metaheuristics: Using Tabu Search and Tabu GA as a Case , 2009, 2009 Ninth International Conference on Hybrid Intelligent Systems.

[18]  Sumanta Basu.  Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey , 2012 .

[19]  Razamin Ramli,et al.  An improved tabu search for solving symmetric traveling salesman problems , 2011, 2011 IEEE Colloquium on Humanities, Science and Engineering.

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

[21]  Yu Zhang,et al.  Single-machine ready times scheduling with group technology and proportional linear deterioration , 2014 .

[22]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[23]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[24]  Tai-Hsi Wu,et al.  A water flow-like algorithm for manufacturing cell formation problems , 2010, Eur. J. Oper. Res..

[25]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

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

[27]  D. Kaur,et al.  Performance enhancement in solving Traveling Salesman Problem using hybrid genetic algorithm , 2008, NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society.

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

[29]  Karin Ackermann.  Automation Production Systems And Computer Integrated Manufacturing , 2016 .

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

[31]  Kazuyuki Aihara,et al.  Combination of Chaotic Neurodynamics with the 2-opt Algorithm to Solve Traveling Salesman Problems , 1997 .

[32]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[33]  Yi Liu,et al.  Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP , 2009, GEC '09.

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

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

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

[37]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

[38]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[39]  Peter Beike,et al.  Automation Production Systems And Computer Integrated Manufacturing , 2016 .

[40]  Arthur Tórgo Gómez,et al.  A Study for Manufacturing Cell Formation Approach Considering Setup , 2011, ICINCO.

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

[42]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..