Lecture timetabling using heuristic technique / Emilia Adzmi

By: Material type: TextTextPublication details: Kuantan, Pahang : UMP, 2012Description: xii, 57 p. : ill. ; 30 cm. + 1 CD-ROMISBN:
  • THE0002363(Local)
Subject(s): Dissertation note: Project paper (Bachelor of Computer Science (Software Engineering)) -- Universiti Malaysia Pahang - 2012 Abstract: The purpose of this paper is to try to develop a system about lecture timetabling problem. This project presents about Lecture Timetabling using Heuristic Method. Timetabling is a well known difficult combinatorial problem. In recent years, several techniques have been used to automatically generate university timetabling problems, including graph colouring heuristics and a lot more. Timetabling deals with the problem of placing certain resources into a limited number of time slots, subject to given constraints, in order to satisfy a set of stated objectives to the highest possible extent. In this paper, by using the proposed heuristic technique, a lecture timetable is produced considering some constraints that are able to be satisfied. Though it is impossible to consider all constraints in one timetable, the system proposed try to satisfied some of the constraints in order to generate the lecture timetable.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Final Year Report Final Year Report UMPLIB GAMBANG T57.84 .E45 2012 rs Bc. (Browse shelf(Opens below)) 1 Not for loan 0000068612
Final Year Report Final Year Report UMPLIB GAMBANG CD 6518 | T57.84 .E45 2012 rs Bc. (Browse shelf(Opens below)) 1 Not for loan 0000068613

Project paper (Bachelor of Computer Science (Software Engineering)) -- Universiti Malaysia Pahang - 2012

Bibliography : p. 55

The purpose of this paper is to try to develop a system about lecture timetabling problem. This project presents about Lecture Timetabling using Heuristic Method. Timetabling is a well known difficult combinatorial problem. In recent years, several techniques have been used to automatically generate university timetabling problems, including graph colouring heuristics and a lot more. Timetabling deals with the problem of placing certain resources into a limited number of time slots, subject to given constraints, in order to satisfy a set of stated objectives to the highest possible extent. In this paper, by using the proposed heuristic technique, a lecture timetable is produced considering some constraints that are able to be satisfied. Though it is impossible to consider all constraints in one timetable, the system proposed try to satisfied some of the constraints in order to generate the lecture timetable.

Perpustakaan Universiti Malaysia Pahang Al-Sultan Abdullah
26600 Pekan, Pahang Darul Makmur
Phone: +609 431 5063 (Gambang) / +609 431 5035 (Pekan)
Email: umplibrary@umpsa.edu.my

Connect With Us