I am working in university time tabling problem. I need a measure of the problem difficulty. For example, a lecturer who can come one day only per week is a more difficult constrain than another one who can come twice per week. The same for rooms and so on. Is there a commonly agreed measures to do this for a particular problem. I am suggesting a probability based function to prior rise these constrains but I am searching for something that is standard.
Seniority is treated as a weight for the constraint in the fitness function. If it contradicts with accommodating external lecturers, external lecturers will be assigned higher weight.
Dear Dr. Ahmed,
I think this scheduling problem is a typical combinatorics problem whose complexity may range from Easy to NP-Complete. Below are some links that may help.
Regards!
Mostafa
http://www.unitime.org/papers/patat07.pdf
http://digitalcommons.calpoly.edu/cgi/viewcontent.cgi?article=1255&context=theses
http://www.jdl.ac.cn/turing/pdf/p98-karp.pdf
http://www.wisetimetable.com/
- Badges
- Science topic
- Similar topics
- Mathematics
- Statistics
- Probability