Penerapan Algoritma Welch-Powell Pada Penyusunan Jadwal Perkuliahan di Program Studi Pendidikan Matematika
release_4cnmbxgrczc57iyc7jexc7f5ya
by
Ririn Mufidatur Rohmawati,
M. Ivan Ariful Fathoni,
Ismanto Ismanto
2022 Volume 10, p200-210
Abstract
Graph theory can be applied in course scheduling. The problem discussed in this study is scheduling courses in the UNUGIRI Mathematics Education Study Program using graph coloring. The purpose of this study is to prevent the occurrence of overlap (cross-over) in the preparation of courses. Good scheduling is a schedule that can be carried out by all related parties in teaching and learning activities. The algorithm used in this study is the Welch-Powell algorithm. The research was conducted using an axiomatic deductive method by deriving existing axioms or theorems, then applied to vertex coloring on the graph representation of the lecture scheduling of the UNUGIRI mathematics education study program. The readiness matrix to teach odd-semester courses is obtained based on the Welch-Powell algorithm. 2022/2023 with six different colors. The six colors represent the scheduling of 26 UNUGIRI Mathematics Education Study Program courses into six days without any cross-over.
In application/xml+jats
format
Archived Files and Locations
application/pdf
431.0 kB
file_uxk5mjr2jred7agv2csszp3woa
|
ejurnal.ung.ac.id (publisher) web.archive.org (webarchive) |
article-journal
Stage
published
Date 2022-10-28
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar