On Solving Modern Scheduling Problems with Real-life Constraints

Student: Filippova Marina

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

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2021

The problem of scheduling is one of the most common and difficult to calculate NP complex problems, but at the same time it is an integral part of the functioning of any educational institution. In this paper, we study several algorithms such as: random search, local search with different neighborhoods for generating schedules. As well as based on the results of a comparative analysis of the results, the most suitable algorithm for solving the problem of scheduling in the Nizhny Novgorod branch of the Higher School of Economics will be selected according to the formed criteria. As test data, real schedules compiled by employees of the educational institution will be used.

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