Enhancing the Sorting Layers in the Initial Stage of High School Timetabling

The high school timetabling problem (HSTP) is considered as an NP-Complete problem as the optimal solution for it, is still not discovered by any algorithm. Generally, NP-Complete problem was solved firstly by constructing the initial solution, in the construction phase. The initial solution will be...

Full description

Bibliographic Details

Main Authors:	Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza
Format:	Conference or Workshop Item
Language:	en
Published:	2020
Subjects:	QA75 Electronic computers. Computer science
Online Access:	https://repo.uum.edu.my/id/eprint/27227/1/ISCAIE%202020%2059%2063.pdf https://repo.uum.edu.my/id/eprint/27227/ http://doi.org/10.1109/ISCAIE47305.2020.9108804
Tags:	Add Tag No Tags, Be the first to tag this record!