Detail Penjadwalan Job Shop Statik Dengan Algoritma Tabu Search   Oleh:  Panggabean, Henry P. Jenis: Article from Bulletin/Magazine Dalam koleksi: Integral: Majalah Ilmiah Matematika dan Ilmu Pengetahuan Alam vol. 10 no. 1 (Mar. 2005), page 34-45. Topik: job shops; job shop schedulling; tabu serach algorithm; makespan Ketersediaan Perpustakaan Pusat (Semanggi) Nomor Panggil: II48.2 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada     Lihat Detail Induk Isi artikel This paper presents the application of tabu search (TS) algorithm in solving static job shop scheduling problem. Software implementation proves that ths algorithm can give valid job shops schedules. The quality of solution is measured with completion time (makespan) and compared with result from simulated annealing (SA) algorithm and quant system scheduling software. It is concluded that TS algorithm exceeds SA algorithm and quant system in terms of solution quality, with reasonable computation time. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Kembali

Copyright © 2006, 2007 Unika Atma Jaya, all rights reserved