| Autor: |
Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2024, Vol. 2799 Issue 1, p1-9, 9p |
| Abstrakt: |
This paper presents a real-world school timetabling problem (STP) at a school in Malaysia. The previous studies of solving real-world datasets of STP were focused more on the approaches, rather than the details on generating the real-world of STP datasets. This study aims to provide details on producing the real-world datasets of STP based on the XHSTT dataset format. The real-world case problem has the same constraints as depicted in XHSTT dataset and are categorized into three difficulty levels which are easy, normal and hard based on the difficulty level of preassigned teachers. The STP timetable in this study was obtained from a primary school located in the north of Kedah, Malaysia. Next, the XHSTT dataset was solved using the KHE construction method to produce the solution. The proposed solutions adheres to all the hard and soft constraints set for the datasets. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
