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...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/27227/1/ISCAIE%202020%2059%2063.pdf |