On NP-completeness of the cell formation problem
Computational Complexity
2019-01-10 v1
Abstract
In the current paper we provide a proof of NP-completeness for the CFP problem with the fractional grouping efficacy objective. For this purpose we first consider the CFP with the linear objective minimizing the total number of exceptions and voids. Following the ideas of Pinheiro et al. (2016) we show that it is equivalent to the Bicluster Graph Editing Problem (BGEP), which is known to be NP-complete (Amit, 2004). Then we suggest a reduction of the CFP problem with the linear objective function to the CFP with the grouping efficacy objective.
Cite
@article{arxiv.1901.02778,
title = {On NP-completeness of the cell formation problem},
author = {Mikhail V. Batsyn and Ekaterina K. Batsyna and Ilya S. Bychkov},
journal= {arXiv preprint arXiv:1901.02778},
year = {2019}
}
Comments
9 pages