• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

HEURISTIC AND EXACT ALGORITHMS FOR THE CELL FORMATION PROBLEM

Student: Il`ya By`chkov

Supervisor: Mikhail Vladimirovich Batsyn

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Master

Year of Graduation: 2014

<div>In this paper I consider the Cell Formation Problem in Group Technology</div><div>with grouping efficacy as an objective function. I present a heuristic approach</div><div>for obtaining high-quality solutions of the CFP and two linear programming models that</div><div>allow to get exact solutions for many CFP instances. The suggested heuristic applies an</div><div>improvement procedure that is repeated many times for randomly generated cell configurations.</div><div>Exact models prove optimality of many known solutions for the CFP in</div><div>its most common formulation with a variable number of cells. My computational</div><div>experiments are performed for popular benchmark instances taken from</div><div>the literature with sizes from 5x7 to 40x100.</div>

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses