M. Ahmad and M. Gourgand and C. Caux Transformation of Course Timetablinng Problem to RCPSP
1744 - 1749
2012
6
8
International Journal of Mechanical, Aerospace, Industrial, Mechatronic and Manufacturing Engineering http://waset.org/publications/1082
http://waset.org/publications/68
World Academy of Science, Engineering and Technology
The ResourceConstrained Project Scheduling
Problem (RCPSP) is concerned with singleitem or small batch
production where limited resources have to be allocated to dependent
activities over time. Over the past few decades, a lot of work has
been made with the use of optimal solution procedures for this basic
problem type and its extensions. Brucker and Knust1 discuss, how
timetabling problems can be modeled as a RCPSP. Authors discuss
high school timetabling and university course timetabling problem as
an example. We have formulated two mathematical formulations of
course timetabling problem in a new way which are the prototype of
singlemode RCPSP. Our focus is to show, how course timetabling
problem can be transformed into RCPSP. We solve this
transformation model with genetic algorithm.
International Science Index 68, 2012