GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence

References

• Díaz, J. A., Luna, D. E., & Zetina, C. A. (2013). A hybrid algorithm for the manufacturing cell formation problem. Journal of Heuristics, 19(1), 77–96.
   Web of Science ®Google Scholar
• Díaz, J. A., Luna, D., & Luna, R. (2012). A grasp heuristic for the manufacturing cell formation problem. TOP, 20(3), 679–706.
   Web of Science ®Google Scholar
• Faigle, U., Schrader, R., & Suletzki, R. (1987). A cutting plane algorithm for optimal graph partitioning. Methods of Operations Research, 57, 109–116.
   Google Scholar
• Feo, T., & Resende, M. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109–133.
   Web of Science ®Google Scholar
• Glover, F. (1996). Tabu search and adaptive memory programming: advances, applications and challenges. Interfaces in Computer Science and Operations Research, 7(1), 1–75.
   Google Scholar
• Gonçalves, J. F., & Resende, M. G. (2004). An evolutionary algorithm for manufacturing cell formation. Computers & Industrial Engineering, 47(2), 247–273.
   Web of Science ®Google Scholar
• Karoum, B., & Elbenani, B. (2016). A hybrid clonal algorithm for the cell formation problem with variant number of cells. Production Engineering, 1(11), 19–28.
   Google Scholar
• Laguna, M., & Marti, R. (1999). Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11(1), 44–52.
   Web of Science ®Google Scholar
• Martins, I. C., Pinheiro, R. G., Protti, F., & Ochi, L. S. (2015). A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. Expert Systems with Applications, 42(22), 8947–8955.
   Web of Science ®Google Scholar
• Muruganandam, A., Prabhaharan, G., Asokan, P., & Baskaran, V. (2005). A memetic algorithm approach to the cell formation problem. The International Journal of Advanced Manufacturing Technology, 25(9), 988–997.
   Web of Science ®Google Scholar
• Noktehdan, A., Seyedhosseini, S., & Saidi-Mehrabad, M. (2015). A metaheuristic algorithm for the manufacturing cell formation problem based on grouping efficacy. The International Journal of Advanced Manufacturing Technology, 82, 25–37.
   Web of Science ®Google Scholar
• Papaioannou, G., & Wilson, J. M. (2010). The evolution of cell formation problem methodologies based on recent studies (1997–2008): Review and directions for future research. European Journal of Operational Research, 206(3), 509–521.
   Web of Science ®Google Scholar
• Raja, S., & Anbumalar, V. (2016). An effective methodology for cell formation and intra-cell machine layout design in cellular manufacturing system using parts visit data and operation sequence data. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 3(38), 869–882.
   Google Scholar
• Resendel, M. G., & Ribeiro, C. C. (2005). GRASP with path-relinking: Recent advances and applications (pp. 29–63). Boston, MA: Springer, US.
   Google Scholar
• Saeedi, S., Solimanpur, M., Mahdavi, I., & Javadian, N. (2010). Heuristic approaches for cell formation in cellular manufacturing. Journal of Software Engineering and Applications, 3(07), 674.
   Google Scholar
• Sherali, H. D., & Smith, J. C. (2001). Improving discrete model representations via symmetry considerations. Management Science, 47(10), 1396–1407.
   Web of Science ®Google Scholar
• Sofianopoulou, S. (1993, October). A mathematical programming approach to the manufacturing systems cell formation problem. Proceedings, 2nd Balkan Conference on OR, Salonica.
   Google Scholar
• Sofianopoulou, S. (1997). Application of simulated annealing to a linear model forthe formulation of machine cells ingroup technology. International Journal of Production Research, 35(2), 501–511.
   Web of Science ®Google Scholar
• Sorensen, M. (1995). A polyhedral approach to graph partitioning. PhD thesis, Aarhus School of Business.
   Google Scholar
• Sorensen, M. M. (1999). An adaptation of the kernighan-lin heuristic to the simple graph partitioning problem ( Working paper 99-1). Department of Management Science and Logistics, Aarhus School of Busines.
   Google Scholar
• Spiliopoulos, K., & Sofianopoulou, S. (2003). Designing manufacturing cells: A staged approach and a tabu search algorithm. International Journal of Production Research, 41(11), 2531–2546.
   Web of Science ®Google Scholar
• Spiliopoulos, K., & Sofianopoulou, S. (2008). An efficient ant colony optimization system for the manufacturing cells formation problem. The International Journal of Advanced Manufacturing Technology, 36(5), 589–597.
   Web of Science ®Google Scholar
• Wu, T.-H., Chang, C.-C., & Yeh, J.-Y. (2009). A hybrid heuristic algorithm adopting both boltzmann function and mutation operator for manufacturing cell formation problems. International Journal of Production Economics, 120(2), 669–688.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar