1 citations · 1 across the 4 of their papers we have counts for
5 papers
On NP-completeness of the cell formation problem
Mikhail V. Batsyn, Ekaterina K. Batsyna, Ilya S. Bychkov
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…
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search
Alexander Ponomarenko, Irina Utkina, Mikhail Batsyn
One of the approaches for the nearest neighbor search problem is to build a network which nodes correspond to the given set of indexed objects. In this case the search of the close…
Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem
Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos
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-qualit…
An efficient exact model for the cell formation problem with a variable number of production cells
Ilya Bychkov, Mikhail Batsyn
The Cell Formation Problem has been studied as an optimization problem in manufacturing for more than 90 years. It consists of grouping machines and parts into manufacturing cells…
A branch and bound algorithm for a fractional 0-1 programming problem
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manuf…