Computational models for timetabling problem
The timetabling problem is to find a schedule of activities in space/time that satisfies a prescribed set of operational and resource constraints and which maximizes an objective function that reflects the value of the schedule. Constructing an effective timetable is always a challenging task for an...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
American Institute of Mathematical Sciences
2014
|
| Online Access: | http://hdl.handle.net/20.500.11937/47569 |
| _version_ | 1848757868504809472 |
|---|---|
| author | Aizam, Nur aidya Caccetta, Louis |
| author_facet | Aizam, Nur aidya Caccetta, Louis |
| author_sort | Aizam, Nur aidya |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | The timetabling problem is to find a schedule of activities in space/time that satisfies a prescribed set of operational and resource constraints and which maximizes an objective function that reflects the value of the schedule. Constructing an effective timetable is always a challenging task for any scheduler. Most literature research focuses on specic applications and the resulting models are not easily applied to problems other than those for which they were designed for. In this paper, we construct a general model for university course timetabling. Our model incorporates a total of 17 different types of requirements identified in the literature as well as three new constraint types that we think should be part of the restrictions in a general university based timetabling model. An integer programming (IP) model is presented which incorporates restrictions that need to be satisfied and requests that are included in the objective function. We implement and test our models using the AIMMS mathematical software package. Computational results on a number of case studies are favorable and demonstrate the value of our approach. |
| first_indexed | 2025-11-14T09:34:56Z |
| format | Journal Article |
| id | curtin-20.500.11937-47569 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:34:56Z |
| publishDate | 2014 |
| publisher | American Institute of Mathematical Sciences |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-475692017-09-13T14:13:44Z Computational models for timetabling problem Aizam, Nur aidya Caccetta, Louis The timetabling problem is to find a schedule of activities in space/time that satisfies a prescribed set of operational and resource constraints and which maximizes an objective function that reflects the value of the schedule. Constructing an effective timetable is always a challenging task for any scheduler. Most literature research focuses on specic applications and the resulting models are not easily applied to problems other than those for which they were designed for. In this paper, we construct a general model for university course timetabling. Our model incorporates a total of 17 different types of requirements identified in the literature as well as three new constraint types that we think should be part of the restrictions in a general university based timetabling model. An integer programming (IP) model is presented which incorporates restrictions that need to be satisfied and requests that are included in the objective function. We implement and test our models using the AIMMS mathematical software package. Computational results on a number of case studies are favorable and demonstrate the value of our approach. 2014 Journal Article http://hdl.handle.net/20.500.11937/47569 10.3934/naco.2014.4.269 American Institute of Mathematical Sciences restricted |
| spellingShingle | Aizam, Nur aidya Caccetta, Louis Computational models for timetabling problem |
| title | Computational models for timetabling problem |
| title_full | Computational models for timetabling problem |
| title_fullStr | Computational models for timetabling problem |
| title_full_unstemmed | Computational models for timetabling problem |
| title_short | Computational models for timetabling problem |
| title_sort | computational models for timetabling problem |
| url | http://hdl.handle.net/20.500.11937/47569 |