Cell Formation Problem: An Multithreading Tabu Search for Setup Time Optimization for Limited Machine Magazines - A New Solution for a Classical Problem

Arthur T. Gómez, Felipe R. Ferrary, José V. Canto Dos Santos, Leonardo Chiwiacowsky

2014

Abstract

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.

References

  1. Basu, S., 2012. Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey, American Journal of Operations Research. Vol. 2 No. 2, pp. 163-173.
  2. Black, P. E., 2005. Greedy algorithm, in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds.
  3. Boctor, F. F., 1991. A linear formulation of the machinepart cell formation problem. International Journal of Production Research; 29(2):343-56.
  4. Chan, H. M., Milner, D. A., 1982. Direct clustering algorithm for group formation in cellular manufacture. Journal of Manufacturing Systems; 1:65-75.
  5. Chandrasekharan, M. P. , Rajagopalan, R., 1986. An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. International Journal of Production Research;24(2):451-64.
  6. Chandrasekharan M. P., Rajagopalan R., 1986. MODROC: an extension of rank order clustering for group technology. International Journal of Production Research; 24(5):1221-64.
  7. Crainic, T. G., Gendreau, M., Soriano P., Toulouse, M., 1993. A Tabu Search Procedure for Multicommodity Location/Allocation with Balancing Requirements, Annals of Operations Research, Vol. 41, pp. 359-383.
  8. Croes, G. A., 1958. A method for solving traveling salesman problems. Operations Res. 6. , pp., 791-812.
  9. Fiechter, C. N., 1994. A parallel tabu search algorithm for large traveling salesman problems, Discrete Applied Mathematics, Volume 51, Issue 3.
  10. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 1, p. 533-549.
  11. Gómez, A. T., 1996. Modelo para o sequenciamento de partes e ferramentas em um sistema de manufatura flexível com restrições às datas de vencimento e à capacidade do magazine, PhD thesis, Instituto Nacional de Pesquisas Espaciais, São José dos Campos, São Paulo, Brasil.
  12. Gómez, A. T., Linck, I., Galafassi, C., Wickert, T., 2011. A Study for Manufacturing Cell Formation Approach Considering Setup, 8th International Conference, ICINCO 2011 Noordwijkerhout, The Netherlands, p. 43-48.
  13. Greistorfer, P., 2003. A Tabu Scatter Search Metaheuristic for the Arc Routing Problem, Computers and Industrial Engineering, Vol. 44, No. 2.
  14. Groover, M. P., 2001. Automation, Production Systems, and Computer-Integrated Manufacturing. Upper Saddle River, New Jersey: Prentice-Hall, USA.
  15. Hasegawa, M., Ikeguchi, T., Aihara, K., 1997. Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problem. Physical Review Letters, pp. 2344-2347.
  16. He, Y., Qiu, Y., Liu, G., Lei, K., 2005. A parallel adaptive tabu search approach for traveling salesman problems, Natural Language Processing and Knowledge Engineering.
  17. James, T. L., Brown, E. C. and Keeling, K. B., 2007. A hybrid grouping genetic algorithm for the cell formation problem, Computers and Operations Research, 34, 2059-2079.
  18. Kaur, D., Murugappan, M. M., 2008. Performance enhancement in solving traveling salesman problem using hybrid genetic algorithm, in Proceedings of the 2008 annual meeting of the North American fuzzy information processing society, New York, pp.1-6.
  19. King, J. R., Nakornchai V., 1982. Machine-component group formation in group technology: review and extension. International Journal of Production Research; 20(2):117-33.
  20. Kothari, R., Ghosh, D., 2013. Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighbourhoods, European Journal of Operational Research, Volume 224, Issue 1, Pages 93- 100.
  21. Kumar, K. R., Chandrasekharan, M. P., 1990. Grouping efficacy: A quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. International Journal of Production Research, 28(2), 233-243.
  22. Kusiak, A., Cho, M., 1992. Similarity coefficient algorithm for solving the group technology problem, International Journal of Production Research; 30(11):2633-46.
  23. Kusiak, A., Chow, W. S., 1987. Efficient solving of the group technology problem, Journal of Manufacturing Systems, v. 6(2), p. 117-24.
  24. Lau, H., Sim M., and Teo K., 2003. Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles, European Journal of Operational Research, Vol. 148, No. 3.
  25. Li, X., Baki, M. F., Aneja, Y. P., 2011. Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic, Computers & Operations Research, Volume 38, Issue 1, Pages 152- 164.
  26. Lim, Y. F., Hong, P. Y., Ramli, R., Khalid, R., 2011. An improved tabu search for solving symmetric traveling salesman problems, Humanities, Science and Engineering (CHUSER), 2011 IEEE Colloquium on , vol., no., pp.851,854.
  27. Liu, Y., Xiong, S., and Liu, H., 2009. Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP, Proceedings of GEC'09, Shanghai, pp.895-898.
  28. Mosier, C. T., Taube, L., 1985. The facets of group technology and their impact on implementation. OMEGA; 13(5):381-91.
  29. Seifoddini, H., Wolfe, P. M., 1986. Application of the similarity coefficient method in group technology. IIE Transactions; 18(3):271-7.
  30. Seifoddini, H., 1989. A note on the similarity coefficient method and the problem of improper machine assignment in group technology applications. International Journal of Production Research; 27(7):1161-5.
  31. Selim, M. S., Askin, R. G., Vakharia, A. J., 1998. Cell formation in group technology: review evaluation and directions for future research. Computers and Industrial Engineering 34 (1), 3-20.
  32. Semet, F., Taillard, E. D., 1993. Solving real-life vehicle routing problems efficiently using Tabu Search, Annals of Operations Research. Vol. 41, pp. 469-488.
  33. Sorlin, S., Christine, S., 2005. Reactive Tabu Search for Measuring Graph Similarity, Graph-Based Representations in Pattern Recognition, pp. 172-182.
  34. Spiliopoulos, K., Sofianopoulou , S., 2008. An efficient ant colony optimization system for the manufacturing cells formation problem, International Journal of Advanced Manufacturing Technology, 36, 589-597.
  35. Tang H., Hooks E., 2005. A Tabu Search Heuristic for the Team Orienteering Problem, Computers & Operations Research, Vol. 32, No. 6.
  36. Ting, C., Li, S. and Lee, C., 2003. On the Harmonious Mating Strategy through Tabu Search, Information Sciences, Vol. 156, No. 3-4.
  37. Tsai, C. W., Tseng, S. P., Chiang; M. C., Yang, C. S., 2009. A Time-Efficient Method for Metaheuristics: Using Tabu Search and Tabu GA as a Case, Hybrid Intelligent Systems, 2009. HIS 7809. Ninth International Conference on, vol.2, no., pp.24-29.
  38. Waghodekar, P. H., Sahu S., 1984. Machine-component cell formation in group technology MACE. International Journal of Production Research;22:937- 48.
  39. Wemmerlöv, U., Hyer, N. L., 1989. Cellular manufacturing in the U.S. industry: a survey of users, International Journal of Production Research 27(9), 1511-1530.
  40. Wu, T. H., Chung, S. H., Chang, C. C., 2010. A water flow-like algorithm for manufacturing cell formation problems. European Journal of Operational Research 205(2): 346-360.
  41. Wu, X., Chu, C.H., Wang, Y., Yue, D., 2007. Genetic algorithms for integrating cell formation with machine layout and scheduling, Computers & Industrial Engineering, 53, Issue 2, Pages 277-289.
  42. Xu, Y. T., Zhang, Y., Huang, X., 2014. Single-machine ready times scheduling with group technology and proportional linear deterioration, Applied Mathematical Modelling, Volume 38, Issue 1, pp. 384- 391.
Download


Paper Citation


in Harvard Style

Gómez A., Ferrary F., Canto Dos Santos J. and Chiwiacowsky L. (2014). Cell Formation Problem: An Multithreading Tabu Search for Setup Time Optimization for Limited Machine Magazines - A New Solution for a Classical Problem . In Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-758-039-0, pages 332-339. DOI: 10.5220/0005063403320339


in Bibtex Style

@conference{icinco14,
author={Arthur T. Gómez and Felipe R. Ferrary and José V. Canto Dos Santos and Leonardo Chiwiacowsky},
title={Cell Formation Problem: An Multithreading Tabu Search for Setup Time Optimization for Limited Machine Magazines - A New Solution for a Classical Problem},
booktitle={Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2014},
pages={332-339},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005063403320339},
isbn={978-989-758-039-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Cell Formation Problem: An Multithreading Tabu Search for Setup Time Optimization for Limited Machine Magazines - A New Solution for a Classical Problem
SN - 978-989-758-039-0
AU - Gómez A.
AU - Ferrary F.
AU - Canto Dos Santos J.
AU - Chiwiacowsky L.
PY - 2014
SP - 332
EP - 339
DO - 10.5220/0005063403320339