| Peer-Reviewed

Optimization of a New Tool Switching Problem in Flexible Manufacturing Systems with a Tool Life by a Genetic Algorithm

Received: 31 October 2016     Accepted: 11 November 2016     Published: 23 December 2016
Views:       Downloads:
Abstract

This paper considers a tool switching problem (ToSP) in flexible manufacturing systems (FMSs). Indeed, a new version of the ToSP that may be faced in practice is proposed. In this paper, a tool life is considered for each tool and a new formulation of the ToSP is presented, however, because of the complexity of such an NP-hard problem, the exact method can’t be used to solve large-sized problems. Therefore, a well-known meta-heuristic method, genetic algorithm (GA), is proposed to solve the problem. Furthermore, the computational results obtained by the proposed GA and the B&B methods are compared by performing on several non-large dimension instances. Finally, it is shown that the GA results are promising.

Published in International Journal of Industrial and Manufacturing Systems Engineering (Volume 1, Issue 3)
DOI 10.11648/j.ijimse.20160103.12
Page(s) 52-58
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2016. Published by Science Publishing Group

Keywords

Tool Switching, Flexible Manufacturing System, Total Part Tardiness, Tool Purchasing Cost, Genetic Algorithm

References
[1] Belady, L. A study of replacement algorithms for virtual storage computers, IBM Systems Journal., 1966, 5, 78–101.
[2] El Maraghy, H. A. Automated tool management in flexible manufacturing, Journal of Manufacturing Systems., 1985, 4 (1), 1–14.
[3] Kiran, A., and Krason, R. Automated tooling in a flexible manufacturing system, Industrial Engineering., 1988, 20, 52–57.
[4] Tang, C. S., and Denardo, E. V. Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches, Oper. Res., 1988, 36 (5), 767–777.
[5] Bard, J. F. A heuristic for minimizing number of tool switches on a flexible machine. IIE Transactions., 1988, 20 (4), 382–391.
[6] Djellab, H., and Djellab, K., and Gourgand, M. A new heuristic based on a hypergraph representation for the tool switching problem, International Journal of Production Economics., 2000, 64 (1-3), 165–176.
[7] Hertz, A., and Laporte, G., and Mittaz, M., and Stecke, K. Heuristics for minimizing tool switches when scheduling part types on a flexible machine, IIE Transactions.,1988 30, 689–694.
[8] Laporte, G., and Salazar Gonzalez, J., and Semet, F. Exact algorithms for the job sequencing and tool switching problem, IIE Transactions., 2004, 36 (1), 37–45.
[9] Oerlemans, A. Production planning for flexible manufacturing systems, PhD Dissertation, University of Limburg, Maastricht, Limburg, Netherlands, 1992.
[10] Crama, Y., and Kolen, A., and Oerlemans, A., and Spieksma, F. Minimizing the number of tool switches on a flexible machine, Int. J. of Flexible Manufacturing Systems., 1994, 6, 33–54.
[11] Sarin, SC., and Chen, CS. The machine loading and tool allocation problem in a flexible manufacturing system. Int J Prod Res., 1987, 25 (7), 1081–94.
[12] Buyurgan, N., and Saygin, C., and Engin Kilic, S. Tool allocation in flexible manufacturing systems with tool alternatives, Robotics and Computer-Integrated Manufacturing., 2004, 20, 341–349.
[13] Salonen, K., and Raduly Baka, C., and Nevalainen, O. S. A note on the tool switching problem of a flexible machine, Computers & Industrial Engineering., 2006, 50(4), 458–465.
[14] Zhou, B. H., and Xi1, L. F., and Cao, Y. S. A beam-search-based algorithm for the tool switching problem on a flexible machine, Int. J. of Advanced Manufacturing Technology., 2005, 25 (9-10), 876–882.
[15] Hertz, A., and Widmer, M. An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Discrete Applied Mathematics., 1993, 65, 319–345.
[16] Al Fawzan, M. A, and Al Sultan, K. S. A tabu search based algorithm for minimizing the number of tool switches on a flexible machine, Computers & Industrial Engineering., 2003, 44 (1), 35–47.
[17] Amaya, E., and Cotta, C., and Fern´andez, A. J. A memetic algorithm for the tool switching problem, in: Proc. Of the Int, Workshop on Hybrid Metaheuristics, Málaga, Sapin, 2008, Lecture Notes in Computer Science (LNCS), Springer-Verlag., 2008, 5, 190–202.
[18] Konak, K., and Kulturel Konak, S., and Azizoglu, M. Minimizing the number of tool switching instants in flexible manufacturing systems, Int. J. of Production Economics., 2008, 116, 298–307.
[19] Tavakkoli-Moghaddam, R., and Aryanezhad, M. B., and Safaei, N., and Azaron, A. Solving a dynamic cell formation problem using Metaheuristics, Applied Mathematics and Computation., 2005, 170, 761–780.
Cite This Article
  • APA Style

    Hamid Dadashi, Shiva Moslemi, Abolfazl Mirzazadeh. (2016). Optimization of a New Tool Switching Problem in Flexible Manufacturing Systems with a Tool Life by a Genetic Algorithm. International Journal of Industrial and Manufacturing Systems Engineering, 1(3), 52-58. https://doi.org/10.11648/j.ijimse.20160103.12

    Copy | Download

    ACS Style

    Hamid Dadashi; Shiva Moslemi; Abolfazl Mirzazadeh. Optimization of a New Tool Switching Problem in Flexible Manufacturing Systems with a Tool Life by a Genetic Algorithm. Int. J. Ind. Manuf. Syst. Eng. 2016, 1(3), 52-58. doi: 10.11648/j.ijimse.20160103.12

    Copy | Download

    AMA Style

    Hamid Dadashi, Shiva Moslemi, Abolfazl Mirzazadeh. Optimization of a New Tool Switching Problem in Flexible Manufacturing Systems with a Tool Life by a Genetic Algorithm. Int J Ind Manuf Syst Eng. 2016;1(3):52-58. doi: 10.11648/j.ijimse.20160103.12

    Copy | Download

  • @article{10.11648/j.ijimse.20160103.12,
      author = {Hamid Dadashi and Shiva Moslemi and Abolfazl Mirzazadeh},
      title = {Optimization of a New Tool Switching Problem in Flexible Manufacturing Systems with a Tool Life by a Genetic Algorithm},
      journal = {International Journal of Industrial and Manufacturing Systems Engineering},
      volume = {1},
      number = {3},
      pages = {52-58},
      doi = {10.11648/j.ijimse.20160103.12},
      url = {https://doi.org/10.11648/j.ijimse.20160103.12},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijimse.20160103.12},
      abstract = {This paper considers a tool switching problem (ToSP) in flexible manufacturing systems (FMSs). Indeed, a new version of the ToSP that may be faced in practice is proposed. In this paper, a tool life is considered for each tool and a new formulation of the ToSP is presented, however, because of the complexity of such an NP-hard problem, the exact method can’t be used to solve large-sized problems. Therefore, a well-known meta-heuristic method, genetic algorithm (GA), is proposed to solve the problem. Furthermore, the computational results obtained by the proposed GA and the B&B methods are compared by performing on several non-large dimension instances. Finally, it is shown that the GA results are promising.},
     year = {2016}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - Optimization of a New Tool Switching Problem in Flexible Manufacturing Systems with a Tool Life by a Genetic Algorithm
    AU  - Hamid Dadashi
    AU  - Shiva Moslemi
    AU  - Abolfazl Mirzazadeh
    Y1  - 2016/12/23
    PY  - 2016
    N1  - https://doi.org/10.11648/j.ijimse.20160103.12
    DO  - 10.11648/j.ijimse.20160103.12
    T2  - International Journal of Industrial and Manufacturing Systems Engineering
    JF  - International Journal of Industrial and Manufacturing Systems Engineering
    JO  - International Journal of Industrial and Manufacturing Systems Engineering
    SP  - 52
    EP  - 58
    PB  - Science Publishing Group
    SN  - 2575-3142
    UR  - https://doi.org/10.11648/j.ijimse.20160103.12
    AB  - This paper considers a tool switching problem (ToSP) in flexible manufacturing systems (FMSs). Indeed, a new version of the ToSP that may be faced in practice is proposed. In this paper, a tool life is considered for each tool and a new formulation of the ToSP is presented, however, because of the complexity of such an NP-hard problem, the exact method can’t be used to solve large-sized problems. Therefore, a well-known meta-heuristic method, genetic algorithm (GA), is proposed to solve the problem. Furthermore, the computational results obtained by the proposed GA and the B&B methods are compared by performing on several non-large dimension instances. Finally, it is shown that the GA results are promising.
    VL  - 1
    IS  - 3
    ER  - 

    Copy | Download

Author Information
  • Department of Industrial Engineering, Kharazmi University, Tehran, Iran

  • Department of Industrial Engineering, Kharazmi University, Tehran, Iran

  • Department of Industrial Engineering, Kharazmi University, Tehran, Iran

  • Sections