Solving Course Timetable Problem by Using Integer Linear Programming (Case Study IE Department of ITS)
August 2015  //  DOI: 10.12962/j23546026.y2015i1.1080
Fakher Shwan Rafeek, Nurhadi Siswanto

Metrics

  • Eye Icon 106 views
  • Download Icon 512 downloads
Metrics Icon 106 views  //  512 downloads
Solving Course Timetable Problem by Using Integer Linear Programming (Case Study IE Department of ITS) Image
Abstract

Making IE department of ITS course timetable by determine the hard and soft constraints then develop an integer programming (ILP) model method to solve this NP-complete problem of Timetabling for solving Hard constraints Assignment problem and to solve the Soft constraints use Penalty Algorithm. Use LINGO software for solving suggested mathematical model to get the final results. Then do numerical analyzes for that results. Finally it achieves the goal for solving the Course Timetable. And get feasible solution of timetable as well as it gets the best required objective what it can get from the case study which is 356 events and it reduces the time of getting one timetable to be just one hour after it was at least 2 weeks.

Full text
Show more arrow
 
More from this conference
Daylighting Performance in Balai Padang Adat House at South Borneo
Daylighting Performance in Balai Padang Adat House at South Borneo Image
Analysis of Spatial Characteristic of Maritime Weather in Java Sea
Analysis of Spatial Characteristic of Maritime Weather in Java Sea Image
🧐  Browse all from this conference

Metrics

  • Eye Icon 106 views
  • Download Icon 512 downloads
Metrics Icon 106 views  //  512 downloads