Fuzzy robust courses scheduling problem (Q1001153): Difference between revisions

We consider examination courses scheduling at university. Two basic courses sharing at least one student cannot be scheduled at the same time. This scheduling problem will be stated as a graph coloring problem. The stability of the scheduled solution would be desirable in the sense that it remains valid also if some additional students want to do the exams, for example those who failed in earlier examination sessions. This stability is defined as the robustness of scheduling courses. We consider a mean value of the fuzzy number of courses incompatibilities as the robustness measure.