Please use this identifier to cite or link to this item:
Title: Application of satisfiability to examination timetabling
Keywords: non-boolean, satisfiability, timetabling, NB-GSAT, NB-WalkSAT, WSAT(OIP)
Issue Date: 7-May-2004
Citation: TANG HAIYING (2004-05-07). Application of satisfiability to examination timetabling. ScholarBank@NUS Repository.
Abstract: This thesis describes approaches for solving non-boolean problems, especially examination timetabling problems, develops and implements three non-boolean procedures--the NB-GSAT procedure, the NB-WalkSAT procedure and the WSAT(OIP) procedure, and uses them on six groups of examination problems and compares the results of the three approaches. When the number of constraints is small (less than 500), the performances of the three procedures do not make much difference. When the number of constraints is larger than 1000, the WSAT(OIP) procedure outperforms the other two procedures, the NB-WalkSAT procedure outperforms the NB-GSAT procedure, with search time especially considered.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
TangHY.pdf715.01 kBAdobe PDF



Page view(s)

checked on Dec 16, 2018


checked on Dec 16, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.