USING GENETIC ALGORITHMS TO UNIVERSITY TIMETABLING PROBLEM

IonuÅ£ Bä‚lan ()
Additional contact information
IonuÅ£ Bä‚lan: “Ştefan cel Mare†University of Suceava, Romania

The USV Annals of Economics and Public Administration, 2022, vol. 22, issue 1(35), 160-166

Abstract: The problem of timetabling in universities is an NP-hard problem, which involves a task scheduling activity for certain people based on multiple constraints and a limited number of resources. This paper addresses a complicated issue, that of scheduling academic classes (timetabling). The aim is to find a feasible schedule for the Faculty of Economics, Administration and Business at the University "Stefan cel Mare" in Suceava. The approach focuses on the use of genetic algorithms and has, as its main objective, the minimization of idle time for students who participate in teaching activities.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://annals.feaa.usv.ro/index.php/annals/article/view/1393/1102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:scm:usvaep:v:22:y:2022:i:1(35):p:160-166

Access Statistics for this article

The USV Annals of Economics and Public Administration is currently edited by Editura Universitatii Stefan cel Mare din Suceava

More articles in The USV Annals of Economics and Public Administration from Stefan cel Mare University of Suceava, Romania, Faculty of Economics and Public Administration Contact information at EDIRC.
Bibliographic data for series maintained by Liviu Scutariu ().