Programming search seems to be major factor of adapting constraint programming paradigm for large-scale real-world application such as timetabling problem. Presented work tries to use explicit search implemented in Mozart/Oz, what allows to create complicated, custom-tailored distribution strategy and search method. Well-known first-fail distribution strategy was not sufficient, because timetabling problem with room allocation is consider and there are two finite domain variables connected with course. Choosing proper course rather than variable is consider and decision is made due several factors.
展开▼
