Evolutionary Time Scheduling

  • Authors:
  • Nadia Nedjah;Luiza de Macedo Mourelle

  • Affiliations:
  • -;-

  • Venue:
  • ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic algorithms are generally used to solve NP-completeproblems, which include scheduling problem in academicinstitutions. Scheduling consists of assigning offered courses toavailable time periods so that the students' satisfaction factor ismaximised while preserving the unbreakable academic rules suchas two distinct courses cannot be scheduled during the sameperiod of time because the same lecturer ministers thecorresponding courses. In this paper, we present an application ofgenetic algorithms to a generic scheduling problem. Thenecessary algorithmic solution is described together with someempirical observations about the performance of the schedulerimplementation.