Open access
Sep 2026
AN INTEGER LINEAR PROGRAMMING MODEL FOR MAXIMIZING PREFERENCE SATISFACTION IN UNIVERSITY TIMETABLING
Manual university course timetabling is a time-consuming, complex, and conflict-prone combinatorial optimization problem, widely recognized as NP-hard due to its intricate constraints. This research automates and optimizes this task for the Department of Statistics at our university using a novel Integer Linear Program...
Pitchaya Wiratchotisatian, Nattapon Surasin, Yanin Sareeso et al.
· Suranaree Journal of Science... · 0 citations