Detail PenjadwaIan Job Shop Statik Dengan Algoritma Simulated Annealing   Oleh:  Panggabean, Henry Pantas Jenis: Article from Bulletin/Magazine Dalam koleksi: Integral: Majalah Ilmiah Matematika dan Ilmu Pengetahuan Alam vol. 7 no. 2 (Oct. 2002), page 97-116. Topik: Job Shop Scheduling; job shop scheduling; algoritma simulated annealing Ketersediaan Perpustakaan Pusat (Semanggi) Nomor Panggil: II48.1 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada     Lihat Detail Induk Isi artikel This paper presents the application of simulated annealing (SA) algorith in solving static job shop scheduling problem. Software implementation proves that this algorith can give valid job shop schedules. The quality of solution is measured with completion time (makespan) as criteria and compared with result from scheduling software named quantity system. It is concluded that SA algorithm is better in quality of solution, especially in large - scale problems, with reasonable computation time. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Kembali

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