Three-phase approach for curriculum-based course timetabling problem. (c2012)

Includes bibliographical references (leaves 92-98).

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Jazzar, Hanaa Salem El- (author)
التنسيق: masterThesis
منشور في: 2012
الموضوعات:
الوصول للمادة أونلاين:http://hdl.handle.net/10725/1252
https://doi.org/10.26756/th.2012.18
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513456352264192
author Jazzar, Hanaa Salem El-
author_facet Jazzar, Hanaa Salem El-
author_role author
dc.creator.none.fl_str_mv Jazzar, Hanaa Salem El-
dc.date.none.fl_str_mv 2012-09-26T08:56:06Z
2012-09-26T08:56:06Z
2012
2012-09-26
2012-06-08
dc.identifier.none.fl_str_mv http://hdl.handle.net/10725/1252
https://doi.org/10.26756/th.2012.18
dc.language.none.fl_str_mv en
dc.publisher.none.fl_str_mv Lebanese American University
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Scheduling -- Data processing
Heuristic programming
Computer algorithms
Problem solving -- Data processing
dc.title.none.fl_str_mv Three-phase approach for curriculum-based course timetabling problem. (c2012)
dc.type.none.fl_str_mv Thesis
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/masterThesis
description Includes bibliographical references (leaves 92-98).
eu_rights_str_mv openAccess
format masterThesis
id LAURepo_daff8859d5cc3203a5efe1142800a8f4
language_invalid_str_mv en
network_acronym_str LAURepo
network_name_str Lebanese American University repository
oai_identifier_str oai:laur.lau.edu.lb:10725/1252
publishDate 2012
publisher.none.fl_str_mv Lebanese American University
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Three-phase approach for curriculum-based course timetabling problem. (c2012)Jazzar, Hanaa Salem El-Scheduling -- Data processingHeuristic programmingComputer algorithmsProblem solving -- Data processingIncludes bibliographical references (leaves 92-98).University course timetabling is an important problem for scheduling courses into predefined periods and rooms over a week with a given set of constraints. This problem is NP-complete and, thus, heuristics are required to produce good suboptimal timetables. This work considers the curriculum based course timetabling problem (CCTP) and proposes three-phase heuristics algorithm that fulfils the requirements of zero hard constraints values and minimal values for soft constraints. The three algorithms are simulated annealing (SA), scatter search (SS) and a tuning heuristic (THEU). We have run our algorithm on subject problems listed at the international timetabling competition in 2007 (ITC2007) and we have compared our results with those of the winner of ITC2007, which is Muller’s hybrid algorithm. Our results show that our approach produces better results than Muller’s for larger or more complex problems.1 bound copy: xviii, 106 leaves; col. ill.; 30 cm. available at RNL.Lebanese American University2012-09-26T08:56:06Z2012-09-26T08:56:06Z20122012-09-262012-06-08Thesisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesishttp://hdl.handle.net/10725/1252https://doi.org/10.26756/th.2012.18eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/12522020-05-18T14:53:47Z
spellingShingle Three-phase approach for curriculum-based course timetabling problem. (c2012)
Jazzar, Hanaa Salem El-
Scheduling -- Data processing
Heuristic programming
Computer algorithms
Problem solving -- Data processing
status_str publishedVersion
title Three-phase approach for curriculum-based course timetabling problem. (c2012)
title_full Three-phase approach for curriculum-based course timetabling problem. (c2012)
title_fullStr Three-phase approach for curriculum-based course timetabling problem. (c2012)
title_full_unstemmed Three-phase approach for curriculum-based course timetabling problem. (c2012)
title_short Three-phase approach for curriculum-based course timetabling problem. (c2012)
title_sort Three-phase approach for curriculum-based course timetabling problem. (c2012)
topic Scheduling -- Data processing
Heuristic programming
Computer algorithms
Problem solving -- Data processing
url http://hdl.handle.net/10725/1252
https://doi.org/10.26756/th.2012.18