Marco P. Carrasco

Learn More
This study explores the application of neural network-based heuristics to the class/teacher timetabling problem (CTTP). The paper begins by presenting the basic CTTP characteristics in terms of hard and soft constraints and proposing a formulation for the energy function required to map the problem within the artificial neural network model. There follow(More)
Course Timetable Problem (CTTP) is considered as a multiassignments problem. This problem occurs during the assignment of a set of events (courses, subjects and teachers) to specific number of appointments (timeslots, days and rooms) under a set of hard and soft constraints. In this paper, the proposed algorithm is represented for solving the CTTP based on(More)
  • 1