Scheduling exams in colleges are a complicated job that is difficult to solve conventionally.
Exam timetabling is one of the combinatorial optimization problems where there is no exact …

The Master Surgery Scheduling Problem (MSSP) can be described as a timetabling problem
involving assigning surgery groups to operating theatre (OT) time slots. Previous MSSP …

The thesis examination is one of the many events that matter to student graduation. Making
a schedule for the session by the coordinator at a related instance is time-consuming …

Sebuah organisasi terkadang membutuhkan solusi untuk permasalahan optimasi lintas
domain. Permasalahan optimasi lintas domain merupakan permasalahan yang memiliki …

The examination timetabling problem is a well researched problem. Various techniques
have been applied to solving this NP-hard problem including genetic algorithms and hyper …

Abstract Examination Timetabling Problem is one of the optimization and combinatorial
problems. It is proved to be a non-deterministic polynomial (NP)-hard problem. On a large …

Penyusunan jadwal perkuliahan merupakan aktivitas administratif yang rutin dilakukan
setiap pergantian semester di lingkungan institusi pendidikan tinggi, salah satunya di STMIK …

In higher education institutions, particularly universities, the task of scheduling examinations
is a heavily constrained problem involving the allocation of exams, and corresponding …

The issue of graph coloring is concerned with assigning colors to each vertex of an
undirected graph so that adjacent vertices are not assigned the same color. Due to its NP …

In the literature, almost all optimization problems in NP-hard class are solved by meta-
heuristics approach. However, this approach has the drawback of requiring tuning …