Iswan Rina, D. Sulistiowati, Diana RaudhatulOktavi
{"title":"使用Welch-Powell算法的图形着色在课程调度中的应用-一个案例研究","authors":"Iswan Rina, D. Sulistiowati, Diana RaudhatulOktavi","doi":"10.1109/ISITDI55734.2022.9944511","DOIUrl":null,"url":null,"abstract":"Subject scheduling is a routine activity carried out by each school before the start of the new school year, so the subject schedule is arranged in such a way, so that there are no identical or conflicting schedules, and no teachers teach at the same time and class. The preparation of the first-semester subject schedule for the 2021/2022 academic year at SMPN 2 Sungai Rumbai, Dharmasraya Regency is one of the problems in graph coloring, this problem will be solved using the Welch-Powell algorithm. This arrangement is done by representing the data in the form of a graph, so that neighboring vertices are obtained. Next, apply the Welch-Powell algorithm to the coloring of graph vertices to obtain chromatic numbers, which means that vertices with the same color can be scheduled together so that the arrangement of the subject schedule can be scheduled on the same day and class.","PeriodicalId":312644,"journal":{"name":"2022 International Symposium on Information Technology and Digital Innovation (ISITDI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graph Coloring Applications in Scheduling Courses using Welch-Powell Algorithm - A Case Study\",\"authors\":\"Iswan Rina, D. Sulistiowati, Diana RaudhatulOktavi\",\"doi\":\"10.1109/ISITDI55734.2022.9944511\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Subject scheduling is a routine activity carried out by each school before the start of the new school year, so the subject schedule is arranged in such a way, so that there are no identical or conflicting schedules, and no teachers teach at the same time and class. The preparation of the first-semester subject schedule for the 2021/2022 academic year at SMPN 2 Sungai Rumbai, Dharmasraya Regency is one of the problems in graph coloring, this problem will be solved using the Welch-Powell algorithm. This arrangement is done by representing the data in the form of a graph, so that neighboring vertices are obtained. Next, apply the Welch-Powell algorithm to the coloring of graph vertices to obtain chromatic numbers, which means that vertices with the same color can be scheduled together so that the arrangement of the subject schedule can be scheduled on the same day and class.\",\"PeriodicalId\":312644,\"journal\":{\"name\":\"2022 International Symposium on Information Technology and Digital Innovation (ISITDI)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Symposium on Information Technology and Digital Innovation (ISITDI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITDI55734.2022.9944511\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Symposium on Information Technology and Digital Innovation (ISITDI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITDI55734.2022.9944511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
学科排班是每个学校在新学年开始前进行的一项例行活动,所以学科排班是这样安排的,没有相同或冲突的排班,没有老师同时上课。在准备2021/2022学年的第一学期课程计划时,在Dharmasraya Regency Sungai Rumbai, SMPN 2是图形着色的问题之一,这个问题将使用Welch-Powell算法来解决。这种排列是通过以图的形式表示数据来完成的,以便获得相邻的顶点。接下来,将Welch-Powell算法应用到图顶点的着色上,得到着色数,这意味着可以将颜色相同的顶点安排在一起,从而将主题日程安排在同一天和同一天上课。
Graph Coloring Applications in Scheduling Courses using Welch-Powell Algorithm - A Case Study
Subject scheduling is a routine activity carried out by each school before the start of the new school year, so the subject schedule is arranged in such a way, so that there are no identical or conflicting schedules, and no teachers teach at the same time and class. The preparation of the first-semester subject schedule for the 2021/2022 academic year at SMPN 2 Sungai Rumbai, Dharmasraya Regency is one of the problems in graph coloring, this problem will be solved using the Welch-Powell algorithm. This arrangement is done by representing the data in the form of a graph, so that neighboring vertices are obtained. Next, apply the Welch-Powell algorithm to the coloring of graph vertices to obtain chromatic numbers, which means that vertices with the same color can be scheduled together so that the arrangement of the subject schedule can be scheduled on the same day and class.