NEW EXAMINATION TIMETABLING ALGORITHM USING THE SUPERSTAR ASSIGNMENT TECHNIQUE

MATTER: International Journal of Science and Technology

View Publication Info
 
 
Field Value
 
Title NEW EXAMINATION TIMETABLING ALGORITHM USING THE SUPERSTAR ASSIGNMENT TECHNIQUE
 
Creator Prachapipat, Pornpun
Leelertpanchai, Arkom
Khancome, Chouvalit
 
Subject Examination Timetabling Principle
Examination Timetabling Algorithm
Registration Problem
Superstar Assignment Technique
 
Description In this paper, a new examination timetabling algorithm, SAT, is introduced. In order to solve the current problems that SAT algorithm can meet the requirement under the limited of all related resources and factors.  It combined with rules, constraints, exceptions and priorities. This algorithm works in three steps: pre-processing, creating superstars and getting rid of superstars. SAT mechanisms sort all related parameters and factors, then determine stars and superstars of each related parameter. Each iteration of algorithm is trying to assign all superstars of all parameters as targets for processing. As well as, the process mechanism is run for putting the output into a suitable timeslot. To prove the algorithm implementation, a dataset from semester 1/2016 of Registration Centre, Ramkhamhaeng University has been selected as test subject. This dataset consists of 20/2 days/periods, 85,000 registered students, 1,325 subjects, 813,253 seats, and 11/76/22,582 buildings/rooms/seats per day. The proposed model could be solved the current problems and shown details of subject such as the colour of answer sheet, room and so on. It could be done within less than two hours, meanwhile the current system took at least one month. For the future work, the large scale of algorithm is to be improved and developed into more dynamic version for a larger volume of data and handling more complicated constraints. Article DOI: https://dx.doi.org/10.20319/mijst.2018.33.253270 This work is licensed under the Creative Commons Attribution-Non-commercial 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/4.0/ or send a letter to Creative Commons, PO Box 1866, Mountain View, CA 94042, USA.
 
Publisher GRDS Publishing
 
Date 2018-02-01
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier https://grdspublishing.org/index.php/matter/article/view/1037
 
Source MATTER: International Journal of Science and Technology; Vol 3 No 3 (2017): Regular Issue
2454-5880
 
Language eng
 
Relation https://grdspublishing.org/index.php/matter/article/view/1037/3249
 
Rights Copyright (c) 2018 Author(s)
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library