Instead we need to choose an approach which visits a subset of the problem/solution spaces. Maybe, the Knapsack problem has many elements of similarity with these problems at large.Ī confirmation that this is both a hard problem and one for which people perennially seek a solution, is to check this (long) list of (mostly commercial) software scheduling toolsīecause of the big number of variables involved, the biggest source of which are, typically, the faculty member's desires -)., it is typically impractical to consider enumerating all possible combinations. Because of the variations in the circumstances in which the problem appears at various schools (for example: Are there constraints with regards to classrooms?, Are some of the classes split in sub-groups some of the time?, Is this a weekly schedule? etc.) there isn't a well known problem class which corresponds to all the scheduling problems. In a nutshell one needs to explore all possible combinations to find the list of acceptable solutions.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |