Бычков Илья Сергеевич
HEURISTIC AND EXACT ALGORITHMS FOR THE CELL FORMATION PROBLEM
In this paper I consider the Cell Formation Problem in Group Technologywith grouping efficacy as an objective function. I present a heuristic approachfor obtaining high-quality solutions of the CFP and two linear programming models thatallow to get exact solutions for many CFP instances. The suggested heuristic applies animprovement procedure that is repeated many times for randomly generated cell configurations.Exact models prove optimality of many known solutions for the CFP inits most common formulation with a variable number of cells. My computationalexperiments are performed for popular benchmark instances taken fromthe literature with sizes from 5x7 to 40x100.