%0 Journal Article %A M. Ahmad and M. Gourgand and C. Caux %D 2012 %J International Journal of Industrial and Manufacturing Engineering %B World Academy of Science, Engineering and Technology %I Open Science Index 68, 2012 %T Transformation of Course Timetablinng Problem to RCPSP %U https://publications.waset.org/pdf/1082 %V 68 %X The Resource-Constrained Project Scheduling Problem (RCPSP) is concerned with single-item 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 Knust[1] 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 single-mode RCPSP. Our focus is to show, how course timetabling problem can be transformed into RCPSP. We solve this transformation model with genetic algorithm. %P 1744 - 1749