@article{(Open Science Index):https://publications.waset.org/pdf/1082, title = {Transformation of Course Timetablinng Problem to RCPSP}, author = {M. Ahmad and M. Gourgand and C. Caux}, country = {}, institution = {}, abstract = {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.}, journal = {International Journal of Industrial and Manufacturing Engineering}, volume = {6}, number = {8}, year = {2012}, pages = {1744 - 1749}, ee = {https://publications.waset.org/pdf/1082}, url = {https://publications.waset.org/vol/68}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 68, 2012}, }