Model Sistem Penjadwalan Kuliah Secara Interaktif  

Oleh:

Djamarus, Djasli

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI
Dalam koleksi: Gematika: Jurnal Manajemen Informatika vol. 8 no. 2 (Jun. 2007), page 151-158.
Topik: kuliah; scheduling process; non deterministic polynomial; course schedule

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: GG4.2 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Computerize scheduling process effort in a university usually hindered by the nature of the scheduling process itself and categorized as the Non deterministic Polynomial (NP). The algorithm of NP Problem can be used only for problems with a limited size of data ; this research is aimed to find a way to relax the problem. An interactive approach is proposed to overcome the problem. This paper describes iterative course scheduling process, where each run will produce some schedule elements to save. Some data will be modified interactively so that, the next run will match all constraint required by the course schedule.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali