We describe one type of scheduling problem, that of scheduling final exams at Memorial University (MUN), a comprehensive Canadian university. It is well-known that the general scheduling problem is NP-complete [1]. Over the years, this problem has attracted a lot of attention and many different approaches have been tried in finding approximate solutions [2]. Here we propose an approximate solut...