General basic 0-1 integer programming model for timetabling problems

This paper focuses on developing a general basic 0-1 integer programming model for various types of timetabling problems. Research shows that numerous models were successfully formulated to solve the timetabling problems in various fields such as job scheduling and examination timetabling. However, the models were incorporated only to the specific problems in specific field. The world of scheduling is still deficient of a general basic integer programming model which can be employed to solve all types of timetabling problems. Therefore, it would be beneficial to have a model which could be applied to problems across different field. This paper analyzes the common basic constraints in different timetabling problems prior generating a general basic model. Randomly generated data which represent the real world data will be used to test and verify the model. Models are solved using AIMMS mathematical software with CPLEX 12.6 as the solver. Results show that the model generated is well performed to the selected timetabling problems in terms of CPU time with solutions to optimal