Improved Variable Neighbourhood Descent (VND) to Solve Universiti Malaysia Sarawak (UNIMAS) Course Timetabling Problem
Academic institutions face the timetabling problem every semester. The task of allocating lectures to limited timeslots and venues must fulfil certain constraints unique to each educational institution. This study investigated heuristic orderings and the variable neighbourhood descent approach to ta...
Saved in:
Main Author: | Mei Ching, Chen |
---|---|
Format: | Thesis |
Language: | English English English |
Published: |
Universiti Malaysia Sarawak
2023
|
Subjects: | |
Online Access: | http://ir.unimas.my/id/eprint/43242/3/chen%20mei%20ching_dsva.pdf http://ir.unimas.my/id/eprint/43242/4/Thesis%20PhD_%20Chen%20Mei%20Ching%20-%2024%20pages.pdf http://ir.unimas.my/id/eprint/43242/5/Thesis%20PhD_%20Chen%20Mei%20Ching.ftext.pdf http://ir.unimas.my/id/eprint/43242/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Hybrid of Heuristic Orderings and Variable Neighbourhood Descent for a Real Life University Course Timetabling Problem
by: Chen, Mei Ching, et al.
Published: (2021) -
Harmony great deluge for solving curriculum based course timetabling problem
by: Wahid, Juliana, et al.
Published: (2013) -
Solving an application of university course timetabling problem by using genetic algorithm
by: Norhana, Shaibatul Khadri
Published: (2022) -
A Survey of university course timetabling problem: perspectives, trends and opportunities
by: Mei ching chen, et al.
Published: (2021) -
A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing
by: Muhammed, Abdullah, et al.
Published: (2019)