Journal article Open Access

Transformation of Course Timetablinng Problem to RCPSP

M. Ahmad; M. Gourgand; C. Caux

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.

Files (228.0 kB)
Name Size
1082.pdf
md5:8d0bc5bd8833bfb8c3e2403d76c0e401
228.0 kB Download
5
4
views
downloads
All versions This version
Views 55
Downloads 44
Data volume 912.0 kB912.0 kB
Unique views 44
Unique downloads 33

Share

Cite as