Ali Berk BehrenkSimge Güçlükol ErginAyhan Özgür ToyGüçlükol Ergin, SimgeToy, Ayhan ÖzgürBehrenk, Ali BerkN.M. Durakbasa , M.G. Gençyılmaz2025-10-0620239789819650583, 9783031991585, 9783031948886, 9789819667314, 9789811937156, 9783030703318, 9789811622779, 9789811969447, 9789819701056, 9789819748051978303124456821954364, 219543562195-435610.1007/978-3-031-24457-5_592-s2.0-85151138267https://www.scopus.com/inward/record.uri?eid=2-s2.0-85151138267&doi=10.1007%2F978-3-031-24457-5_59&partnerID=40&md5=11523dce50f64d316b497c0538f85a9ahttps://gcris.yasar.edu.tr/handle/123456789/8566https://doi.org/10.1007/978-3-031-24457-5_59Course scheduling and classroom assignment problem is a common problem for all educational fields. It is an NP Hard problem. Especially universities should handle this problem while preparing course timetabling for each level due to elective courses and students taking upper/lower-level courses. There is a vast literature on this problem both for modelling and solution approaches. Although the essence of the problems is similar for the most each problem has some unique restriction and/or parameters. We study the timetabling of the courses of Industrial Engineering program at Yaşar University. We develop a mathematical model to maximize the minimum lecturer satisfaction. Due to the computational complexity of the problem we proposed a heuristic solution method namely the Genetic Algorithm. Gene structure we use ensures the feasibility of many constraints of the mathematical model. Computational results of optimal and heuristic method are compared. As a real-life implementation a university in Turkey Industrial Engineering Department data is used and results were reported. © 2024 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccess0–1 Integer Modelling, Course Scheduling, Genetic Algorithm, Mathematical Modelling, Timetabling, Combinatorial Optimization, Computational Complexity, Heuristic Methods, Scheduling Algorithms, 0–1 Integer Modeling, Assignment Problems, Course Scheduling, Course Timetabling, Elective Course, Mathematical Modeling, Modeling Approach, Real-life Implementations, Scheduling Problem, Timetabling, Genetic AlgorithmsCombinatorial optimization, Computational complexity, Heuristic methods, Scheduling algorithms, 0–1 integer modeling, Assignment problems, Course scheduling, Course timetabling, Elective course, Mathematical modeling, Modeling approach, Real-life implementations, Scheduling problem, Timetabling, Genetic algorithmsGenetic Algorithm0–1 Integer ModellingCourse SchedulingMathematical ModellingTimetablingConference Object