#TITLE_ALTERNATIVE#

• Main Author: SOLEHUDIN , ANHAR
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/17986
• Institution: Institut Teknologi Bandung

In this book discussed about creating class schedules for Mathematics Undergraduate Program, Master of Mathematics Program, Master of Actuarial Studies Program, and Master of Mathematics Teaching Program, Bandung Institute of Technology. There are several limitations to be considered in making the schedule. The limitations are related to lecturer, students, and room. Lecturers should not teach two or more courses on the same schedule as much as possible and lecturers do not teach more than two courses per day. Every course are not scheduled on the same schedule and sought no two courses at two successive levels on the same schedule. Many of the rooms that can be used on a schedule are limited. The method that used to solve the problem is the coloring vertex of graph. Each vertex on the graph represents a lecture that will be scheduled. If two distinct lectures cannot be scheduled on the same schedule, two vertex representing that lectures are connected by an edge and that two vertex should not be colored with the same color. Each lectures with the same color vertex can be scheduled on the same schedule as the room is still available. Algorithm developed is a generalization of graph coloring algorithm Welsh-Powell so the above limitations are accommodated.