CD Skripsi

Optimisasi Penjadwalan Penggunaan Ruangan Menggunakan Algoritma Ant Colony Optimization

---

Scheduling is made so that activities run regularly. Many things that can affect the scheduling such as lecturers, students, the amount of space and time available make the process of making the schedule difficult and requires a lot of time. To make it easier in the process of making a schedule for using the room, a number of algorithms appear to process the schedule for using the room. The use of the Ant Colony Optimization Algorithm in the scheduling process uses rules or constraints that must be met in order to produce an optimal room usage schedule. The constraint is divided into two, namely hard constraint and soft constraint. The resulting scheduling system is able to carry out the process of making the best room use schedule so that it can help and simplify the process of making room use schedules.

Keywords: Scheduling, Ant Colony Optimization Algorithm, Hard constraint, Soft constraint

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

03 05.119 (0025)

Penerbit

Pekanbaru : Universitas Riau – FMIPA – Sistem Informasi., 2019

Deskripsi Fisik

xi, 177 hlm.: ill.: 29 cm

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

03 05.119 (0025)

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

SISTEM INFORMASI

Info Detail Spesifik

-

Pernyataan Tanggungjawab

JAKA

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar