In this contribution a hybrid particle swarm optimization (PSO) based algorithm is applied to
high school timetabling problems. The proposed PSO based algorithm is used for creating …

An adaptive algorithm based on computational intelligence techniques is designed,
developed and applied to the timetabling problem of educational organizations. The …

In this paper, we address a university-timetabling problem and present a methodology that
relies on Benders' partitioning for its solution. This partitioning results from the special nature …

Motivated by the recent strategy switch of a large software producer, this paper revisits the
trade-offs associated with tolerating illegal distribution of software products. Conventional …

University course timetabling problem refers to schedule a set of lectures, tutorials and
practical works to a limited number of teachers, classrooms and time slots over a planning …

The complexity of a resource allocation problem (RAP) is usually NP-complete, which
makes an exact method inadequate to handle RAPs, and encourages heuristic techniques …

Feature selection is one of the issues that have been raised in the discussion of machine
learning and statistical identification model. We have provided definitions for feature …

A Timetabling Problem is an NP-hard combinatorial optimization problem which lacks
analytical solution methods. During the last two decades several algorithms have been …

Course scheduling includes a large volume of data with numerous constraints and
unchangeable specifications and each university deals with several times a year. Course …

Feature selection is one of the issues that have been raised in the discussion of machine
learning and statistical identification model. We have provided definitions for feature …