![]() ![]() ![]() Within the easy set, a new subset called the boundary set is introduced to accommodate shuffling strategies to change the given ordering of examinations. On the other hand, the examinations that can be scheduled remain in the easy set. During the construction process, the examinations that cannot be scheduled are identified as the ones causing infeasibility and are moved forward in the difficult set to ensure earlier assignment than the others for the subsequent attempts. Initially, the examinations are placed into the easy set. Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics. The examinations in the difficult set are considered to be hard to place and hence are listed before the ones in the easy set. In this study, we investigate an adaptive decomposition strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |