This paper presents the multi-objective binary integer programming model for online course timetable problems of case studies in mechanical drawing division to maximize to the remaining budget and maximize the overall lecturer satisfaction score. In addition, we propose a method to solve the proposed model with two steps: (1) Data pre-processing (2) Solve the multi-objective binary integer programming model using the branch and cut algorithm, generate a Pareto Front using the ε constraint method, and then organize focus group discussions to choose the optimal solution from a Pareto Front. The results showed that the proposed method increased the remaining budget from 500,950 baht to 501,550 baht or 0.12% and increased the total satisfaction score of lecturers from 47.83 to 49.60 or 3.70%, respectively. In addition, the proposed model reduced the computational time from 173,520 seconds to 55.80 seconds or 99.97%.
Published by : Research and Academic Supports Division College of Industrial Technology, King Mongkut’s University of Technology North Bangkok Contributions welcome at : http://j.cit.kmutnb.ac.th/en/
By using our website, you acknowledge that you have read and understand our Cookie Policy and Privacy Policy.