{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/633"},"canonical_url":"https://search.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/633","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"A multi-phase approach to university course timetabling","abstract":"Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be NP-complete [7, 39]. This M.Sc. thesis presents a multi-phase approach to solve the university level course timetabling problem. We decompose the problem into several sub-problems with reduced complexity, which are solved in separate phases. In phase-1a we assign lectures to professors, phase-1b assigns labs and tutorials to academic assistances and graduate assistants. Phase-2 assigns each lecture to one of the two day-sequences (Monday-Wednesday-Friday or Tuesday-Thursday). In Phase-3, lectures of each single day-sequence are then assigned to time-slots. Finally, in phase-4, labs and tutorials are assigned to days and time-slots. This decomposition allows the use of different techniques as appropriate to solve different phases. Currently different phases are solved using constraint programming and integer linear programming. The multi-phase architecture with the graphical user interface allows users to customize constraints as well as to generate new solutions that may incorporate partial solutions from previously generated feasible solutions.","abstract_html":"Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be NP-complete [7, 39]. This M.Sc. thesis presents a multi-phase approach to solve the university level course timetabling problem. We decompose the problem into several sub-problems with reduced complexity, which are solved in separate phases. In phase-1a we assign lectures to professors, phase-1b assigns labs and tutorials to academic assistances and graduate assistants. Phase-2 assigns each lecture to one of the two day-sequences (Monday-Wednesday-Friday or Tuesday-Thursday). In Phase-3, lectures of each single day-sequence are then assigned to time-slots. Finally, in phase-4, labs and tutorials are assigned to days and time-slots. This decomposition allows the use of different techniques as appropriate to solve different phases. Currently different phases are solved using constraint programming and integer linear programming. The multi-phase architecture with the graphical user interface allows users to customize constraints as well as to generate new solutions that may incorporate partial solutions from previously generated feasible solutions.","abstract_has_math":false,"creators":["Zibran, Minhaz Fahim","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007","degree_name":null,"degree_level":"Masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Hossain, Shahadat"],"committee_chairs":[],"committee_members":[],"year":2007,"date_issued":"2007","date_published":"2007","updated_at":"2026-11-18T20:12:35Z","subjects":["Constraint programming (Computer Science)","Computer scheduling","Scheduling -- Computer programs","Dissertations, Academic"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10133/633","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/10133/633","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F633","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Hossain, Shahadat"]},{"key":"dc:creator","label":"Author","values":["Zibran, Minhaz Fahim","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2008-04-03T20:40:10Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2008-04-03T20:40:10Z"]},{"key":"dc:date.issued","label":"Date","values":["2007"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:publisher.faculty","label":"Dc Publisher Faculty","values":["Faculty of Arts and Science"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["Thesis (University of Lethbridge. Faculty of Arts and Science)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Constraint programming (Computer Science)","Computer scheduling","Scheduling -- Computer programs","Dissertations, Academic"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/633"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["ix, 117 leaves ; 29 cm"]},{"key":"dc:description.abstract","label":"Abstract","values":["Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be NP-complete [7, 39]. This M.Sc. thesis presents a multi-phase approach to solve the university level course timetabling problem. We decompose the problem into several sub-problems with reduced complexity, which are solved in separate phases. In phase-1a we assign lectures to professors, phase-1b assigns labs and tutorials to academic assistances and graduate assistants. Phase-2 assigns each lecture to one of the two day-sequences (Monday-Wednesday-Friday or Tuesday-Thursday). In Phase-3, lectures of each single day-sequence are then assigned to time-slots. Finally, in phase-4, labs and tutorials are assigned to days and time-slots. This decomposition allows the use of different techniques as appropriate to solve different phases. Currently different phases are solved using constraint programming and integer linear programming. The multi-phase architecture with the graphical user interface allows users to customize constraints as well as to generate new solutions that may incorporate partial solutions from previously generated feasible solutions."]},{"key":"dc:title","label":"Title","values":["A multi-phase approach to university course timetabling"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Hossain, Shahadat"],"dc:creator":["Zibran, Minhaz Fahim","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2008-04-03T20:40:10Z"],"dc:date.available":["2008-04-03T20:40:10Z"],"dc:date.issued":["2007"],"dc:description":["ix, 117 leaves ; 29 cm"],"dc:description.abstract":["Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be NP-complete [7, 39]. This M.Sc. thesis presents a multi-phase approach to solve the university level course timetabling problem. We decompose the problem into several sub-problems with reduced complexity, which are solved in separate phases. In phase-1a we assign lectures to professors, phase-1b assigns labs and tutorials to academic assistances and graduate assistants. Phase-2 assigns each lecture to one of the two day-sequences (Monday-Wednesday-Friday or Tuesday-Thursday). In Phase-3, lectures of each single day-sequence are then assigned to time-slots. Finally, in phase-4, labs and tutorials are assigned to days and time-slots. This decomposition allows the use of different techniques as appropriate to solve different phases. Currently different phases are solved using constraint programming and integer linear programming. The multi-phase architecture with the graphical user interface allows users to customize constraints as well as to generate new solutions that may incorporate partial solutions from previously generated feasible solutions."],"dc:identifier.uri":["https://hdl.handle.net/10133/633"],"dc:language.iso":["en_US"],"dc:publisher":["Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:publisher.faculty":["Faculty of Arts and Science"],"dc:relation.ispartofseries":["Thesis (University of Lethbridge. Faculty of Arts and Science)"],"dc:subject":["Constraint programming (Computer Science)","Computer scheduling","Scheduling -- Computer programs","Dissertations, Academic"],"dc:title":["A multi-phase approach to university course timetabling"],"dc:type":["Thesis"],"others:access_status":["open.access"],"thesis:degree_level":["Masters"]},"updated_at":"2026-11-18T20:12:35Z"}