Abstract

<p><em>In college, lecture scheduling is very important in lecturing process, because the activities of lecturers and students depend on lecture schedule. To solve the problem, use Vertex GraphColoring and Simulated Annealing. In Vertex Graph Coloring, look for neighboring and neighboring vertices. While on Simulated Annealing, look for space and exchange positions randomly. The merger of Vertex Graph Coloring and Simulated Annealing aims to create optimum lecture schedule by looking at hard constraint and soft constraint. Testing is done at Faculty of Pharmacy University of North Sumatra, by making schedule from manual to computerized, so it is expected to make the schedule optimally and able to avoid hardconstaint and soft constraint.</em></p>

Highlights

  • Memiliki jadwalkuliah yang baik, berarti memiliki distribusi mata kuliah yang merata setiap hari tanpa mengalami kendala dalam proses perkuliahan

  • lecture scheduling is very important in lecturing process

  • because the activities of lecturers and students depend on lecture schedule

Read more

Summary

Introduction

Berarti memiliki distribusi mata kuliah yang merata setiap hari tanpa mengalami kendala dalam proses perkuliahan. (2017), Penjadwalan Perkuliahan Dengan Metode Vertex Graph Coloring Dan Simulated Annealing, JIME (Journal of Industrial and Manufacture Engineering), 1(2): 56-61 Sistem menerima semua permasalahan untuk menghasilkan solusi terbaik dalam menetapkan jadwal kuliah. Masalah yang dihadapi dalam penjadwalan kuliah adalah masalah kompleks yang harus dihadapi secara teratur.

Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call