Paper Info
Title
Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem.
Abstract
In our paper, we consider the Cell Formation Problem in Group Technology with grouping efficiency as an objective function. We present a heuristic approach for obtaining high-quality solutions of the CFP. The suggested heuristic applies an improvement procedure to obtain solutions with high grouping efficiency. This procedure is repeated many times for randomly generated cell configurations. Our computational experiments are performed for popular benchmark instances taken from the literature with sizes from 10(,times ,)20 to 50(,times ,)150. Better solutions unknown before are found for 23 instances of the 24 considered. The preliminary results for this paper are available in Bychkov et al. (Models, algorithms, and technologies for network analysis, Springer, NY, vol. 59, pp. 43–69, 2013, [7]).
Year
Venue
Field
2017
arXiv: Discrete Mathematics
Cell formation,Heuristic,Mathematical optimization,Group technology,Network analysis,Mathematics
DocType
Volume
Citations 
Journal
abs/1702.07266
0
PageRank 
References 
Authors
0.34
11
3
Name
Order
Citations
PageRank
Ilya Bychkov192.31
Mikhail Batsyn28610.02
Panos M. Pardalos33720397.84