• Title/Summary/Keyword: Groupingefficiency

Search Result 1, Processing Time 0.014 seconds

A Cellular Formation Problem Algorithm Based on Frequency of Used Machine for Cellular Manufacturing System

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.2
    • /
    • pp.71-77
    • /
    • 2016
  • There has been unknown polynomial time algorithm for cellular formation problem (CFP) that is one of the NP-hard problem. Therefore metaheuristic method has been applied this problem to obtain approximated solution. This paper shows the existence of polynomial-time heuristic algorithm in CFP. The proposed algorithm performs coarse-grained and fine-grained cell formation process. In coarse-grained cell formation process, the cell can be formed in accordance with machine frequently used that is the number of other products use same machine with special product. As a result, the machine can be assigned to most used cell. In fine-grained process, the product and machine are moved into other cell that has a improved grouping efficiency. For 35 experimental data, this heuristic algorithm performs better grouping efficiency for 12 data than best known of meta-heuristic methods.