Scheduling is one of the problems which so many researches have been conducted on it
over the years. The university course timetabling problem which is an NP-hard problem is a …

Intelligent scheduling covers various tools and techniques for successfully and efficiently
solving the scheduling problems. In this paper, we provide a survey of intelligent scheduling …

In this paper, we present the existing literature on the human resource allocation problem.
We study the main resolution approaches: exact, heuristic and metaheuristics methods …

This paper approximately solves the high school timetabling problem using a simulated
annealing based algorithm with a newly-designed neighborhood structure. In search for the …

The timetabling problem at universities is an NP-hard problem concerned with instructor
assignments and class scheduling under multiple constraints and limited resources. A novel …

University timetabling is an NP-hard problem, which means that the amount of computation
required to find solutions increases exponentially with problem size. Timetabling is subject …

University course timetabling is one of the most important administrative activities that take
place in all academic institutions. In this work, we go over the main points of recent papers …

The course timetabling problem must be solved by the departments of Universities at the
beginning of every semester. It is a though problem which requires department to use …

Abstract The University Course Scheduling Problem (UCSP) is a complex combinatorial
optimization problem. Most universities still use hand-operated scheduling, which usually …

This paper investigates a high school timetabling problem in a case study related to Kuwait's
public educational system, which is concerned with assigning teachers to classes and time …