Building university timetables is a complex process that considers varying types of
constraints and objectives from one institution to another. The problem solved in this paper …

Scheduling algorithm is one of computation problem with high complexity. One of the
problems is a difficulty to determine an optimal scheduling alternative that is adjusted with …

Many studies have used different types of genetic algorithm in solving examination
timetabling problem. The solutions of the genetic algorithm are found to be efficient and …

We consider a problem of undergraduate students that cannot follow the course schedule of
their curriculum. For example, suppose there is a course which should be taken in semester …

This paper discusses various types of constraints, difficulties and solutions to overcome the
challenges regarding university course allocation problem. A hybrid evolutionary algorithm …

Timetabling problem is one of the very significant problems in many fields of applications. As
mentioned in [6], this is an NP-complete of difficult problem which has many factors and …

Universities usually use academic credit systems for holding all training courses. They have
to establish a suitable timetable for enrollment by students at beginning of every semester …

Sistem penjadwalan di SMA Bina Jaya Palembang masih dilakukan secara manual. Dalam
membuat jadwal, Wakil Kepala Sekolah Bidang Kurikulum harus mempertimbangkan …

The team-orienteering problem (TOP) has broad applicability. Examples of possible uses
are in factory and automation settings, robot sports teams, and urban search and rescue …

Scheduling has an important role in the management of a college where scheduling
problems including complex problems become an important part of its operations. The core …