NDLI: Solving the viva presentations timetabling problem: A case study at FTSM-UKM

Content Provider	IEEE Xplore Digital Library
Author	Ayob, M. Jaradat, G.M. Hamdan, A.R. Sarim, H.M. Nazri, M.Z.A.
Copyright Year	2011
Description	Author affiliation: Data Mining and Optimization Research Group, Centre of Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Faculty of Information Science and Technology, 43600 UKM Bangi, Selangor, Malaysia (Ayob, M.; Jaradat, G.M.; Hamdan, A.R.; Sarim, H.M.; Nazri, M.Z.A.)
Abstract	There is a growing need to automatically timetable viva presentations for postgraduate candidates due to the increasing number of students enrolled each year, and hence, requiring additional personnel effort. The automatic timetabling process involves the assignment of the people involved in the viva timetable into a limited number of timeslots and rooms. In order to produce a feasible timetable, we must satisfy some regulations (hard constraints), while attempting to accommodate as much as possible some preferences (soft constraints). In this work, we tackle the problem of scheduling viva presentations for the Masters degree students at FTSM-UKM as a case study. Each presentation must be attended by a chair of the school (or representative), a chair of the viva presentation, a technical committee member, a student (presenter), an internal examiner and supervisor(s). The presentation must be scheduled into a room and timeslot. In this work, we propose a new objective function to model the problem and to evaluate the quality of the timetable (schedule). We also introduce a greedy constructive heuristic to construct a valid timetable that satisfies all of the hard constraints and tries to satisfy the soft constraints as much as possible. The heuristic will assign the committee and students into an empty timetable based on a pre-ordered list of prioritized elements. These elements are ordered based on the largest enrolment: specifically a technical person who has the largest number of students enrolled under his/her supervision and examination will be ordered first in the list and is first to be assigned into the timetable. Results show that the automated timetabling solver can efficiently produce good quality timetable in reasonable time.
Starting Page	1
Ending Page	4
File Size	563970
Page Count	4
File Format	PDF
ISBN	9781457707537
ISSN	21556830
e-ISBN	9781457707520
DOI	10.1109/ICEEI.2011.6021816
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-07-17
Publisher Place	Indonesia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Information science Conferences greedy constructive heuristic Educational institutions Search problems Viva presentation timetabling problem Personnel Data mining Optimization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem

Harmony great deluge for solving curriculum based course timetabling problem

Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering)

Hyper-heuristic approach for solving nurse rostering problem

An application of genetic algorithm for university course timetabling problem

Harmony Search-based Hyper-heuristic for examination timetabling

Massively Parallel Heuristic Search for Approximate Optimization Problems

Tabu search for solving personnel scheduling problem

University course timetabling using a new hybrid genetic algorithm

Solving the viva presentations timetabling problem: A case study at FTSM-UKM

Similar Documents

A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem

Harmony great deluge for solving curriculum based course timetabling problem

Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering)

Hyper-heuristic approach for solving nurse rostering problem

An application of genetic algorithm for university course timetabling problem

Harmony Search-based Hyper-heuristic for examination timetabling

Massively Parallel Heuristic Search for Approximate Optimization Problems

Tabu search for solving personnel scheduling problem

University course timetabling using a new hybrid genetic algorithm

Solving the viva presentations timetabling problem: A case study at FTSM-UKM