Junrie B. Matias, Arnel C. Fajardo, Ruji P. Medina
{"title":"混合遗传算法在课程调度和教学工作量管理中的应用","authors":"Junrie B. Matias, Arnel C. Fajardo, Ruji P. Medina","doi":"10.1109/HNICEM.2018.8666332","DOIUrl":null,"url":null,"abstract":"Course scheduling is a common problem of all higher educational institutions in several developing countries. Most of these institutions experience a shortage of resources such as teachers and infrastructures. Having small time to recruit, institutions likely to resort in employing beginners to avoid overloading and to fill vacancies immediately. However, directly reassigning classes from senior teacher to the new teacher may lead to unmatched skills required to teach a particular course and more constraints violations. This study presents a hybrid genetic algorithm for course scheduling and teaching workload management. The genetic algorithm is employed with four neighboring operators identified using self-adaptive mechanism during the search process. A data structure of unused resources is used to guide the operators to unused periods. Repair operator is applied to increase the optimality of the solutions. Results show that the proposed algorithm generates feasible and optimized workloads and timetables. The automated system can relieve the decision-makers from the burden of tedious and time-consuming scheduling task in every semester. Hiring additional teaching staff and managing workloads are now much more convenient.","PeriodicalId":426103,"journal":{"name":"2018 IEEE 10th International Conference on Humanoid, Nanotechnology, Information Technology,Communication and Control, Environment and Management (HNICEM)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Hybrid Genetic Algorithm for Course Scheduling and Teaching Workload Management\",\"authors\":\"Junrie B. Matias, Arnel C. Fajardo, Ruji P. Medina\",\"doi\":\"10.1109/HNICEM.2018.8666332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Course scheduling is a common problem of all higher educational institutions in several developing countries. Most of these institutions experience a shortage of resources such as teachers and infrastructures. Having small time to recruit, institutions likely to resort in employing beginners to avoid overloading and to fill vacancies immediately. However, directly reassigning classes from senior teacher to the new teacher may lead to unmatched skills required to teach a particular course and more constraints violations. This study presents a hybrid genetic algorithm for course scheduling and teaching workload management. The genetic algorithm is employed with four neighboring operators identified using self-adaptive mechanism during the search process. A data structure of unused resources is used to guide the operators to unused periods. Repair operator is applied to increase the optimality of the solutions. Results show that the proposed algorithm generates feasible and optimized workloads and timetables. The automated system can relieve the decision-makers from the burden of tedious and time-consuming scheduling task in every semester. Hiring additional teaching staff and managing workloads are now much more convenient.\",\"PeriodicalId\":426103,\"journal\":{\"name\":\"2018 IEEE 10th International Conference on Humanoid, Nanotechnology, Information Technology,Communication and Control, Environment and Management (HNICEM)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 10th International Conference on Humanoid, Nanotechnology, Information Technology,Communication and Control, Environment and Management (HNICEM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HNICEM.2018.8666332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 10th International Conference on Humanoid, Nanotechnology, Information Technology,Communication and Control, Environment and Management (HNICEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HNICEM.2018.8666332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Hybrid Genetic Algorithm for Course Scheduling and Teaching Workload Management
Course scheduling is a common problem of all higher educational institutions in several developing countries. Most of these institutions experience a shortage of resources such as teachers and infrastructures. Having small time to recruit, institutions likely to resort in employing beginners to avoid overloading and to fill vacancies immediately. However, directly reassigning classes from senior teacher to the new teacher may lead to unmatched skills required to teach a particular course and more constraints violations. This study presents a hybrid genetic algorithm for course scheduling and teaching workload management. The genetic algorithm is employed with four neighboring operators identified using self-adaptive mechanism during the search process. A data structure of unused resources is used to guide the operators to unused periods. Repair operator is applied to increase the optimality of the solutions. Results show that the proposed algorithm generates feasible and optimized workloads and timetables. The automated system can relieve the decision-makers from the burden of tedious and time-consuming scheduling task in every semester. Hiring additional teaching staff and managing workloads are now much more convenient.