Limited Searching by Problem Category in State Space Tree to Solve Timetable Scheduling Problems

Jamaludin Hakim, Retantyo Wardoyo, Sri Hartati

Abstract: The main problem in making timetable schedules is finding a solution slot that can meet the minimum tolerable constraints. The search for solution slots aims to place all timetable components in timetable slots that fit the constraints. The searching for solution slots does not have to be carried out on all slots in the timetable but is carried out only on slots that have the potential to provide solutions based on problems that arise. The limited search to solution slots in the state space tree allows for finding the best solution slot based on the problems that arise. Limited searching allows the resulting timetable scheduling to meet tolerable constraints and simplify the searching process.

Keywords: Solution slot, State space tree, Limited searching, Timetable component, TC, Timetable media, TM