Fuzzy robust courses scheduling problem (Q1001153): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10700-007-9003-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2171366001 / rank | |||
Normal rank |
Revision as of 20:23, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fuzzy robust courses scheduling problem |
scientific article |
Statements
Fuzzy robust courses scheduling problem (English)
0 references
12 February 2009
0 references
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.
0 references
Scheduling
0 references
Fuzzy number
0 references
Coloring graph
0 references
Robustness
0 references