Optimasi Penjadwalan Mata Kuliah Menggunakan Metode Vertex Graph Coloring Dan Simulated Annealing

Junaidi, Hadi (2018) Optimasi Penjadwalan Mata Kuliah Menggunakan Metode Vertex Graph Coloring Dan Simulated Annealing. Other thesis, Universitas Katolik Musi Charitas.

	Text IF-2018-1413008-cover.pdf Download (124kB)
	Text IF-2018-1413008-abstract.pdf Download (83kB)
	Text IF-2018-1413008-tableofcontent.pdf Download (208kB)
	Text IF-2018-1413008-chapter1.pdf Download (166kB)
	Text IF-2018-1413008-chapter2.pdf Restricted to Repository staff only Download (580kB) | Request a copy
	Text IF-2018-1413008-chapter3.pdf Restricted to Repository staff only Download (840kB) | Request a copy
	Text IF-2018-1413008-chapter4.pdf Restricted to Repository staff only Download (792kB) | Request a copy
	Text IF-2018-1413008-conclusion.pdf Download (86kB)
	Text IF-2018-1413008-reference.pdf Download (222kB)
	Text IF-2018-1413008-attachment.pdf Restricted to Repository staff only Download (536kB) | Request a copy
	Text IF-2018-1413008-complete.pdf Restricted to Repository staff only Download (2MB) | Request a copy
	Text IF-2018-1413008-summary_id.pdf Restricted to Repository staff only Download (614kB) | Request a copy

Abstract

The need for scheduling exists in various places, such as homes, offices, schools, and universities. It is also needed by Unika Musi Charitas. The Problems which often arise in the process of scheduling subject in the Faculty of Science and Technology (FST) are lecturers, rooms and the subjects whice are often scheduled at the same time. The scheduling problems will be esier if there is a system which can arrange automatically, but it still pay attention to the factors which are existed. The application of vertex graph coloring method for scheduling and algorithm simulated annealing can be the solution for the scheduling problems in FST. At Vertex Graph Coloring, seeking vertex neighbors and no neighbors. While on Simulated Annealing, looking for a room and randomly swapped positions. The integration of Vertex Graph Coloring and Simulated Annealing aims to create optimum lecture schedules by looking at hard constraints and soft constraints.

Actions (login required)

View Item