Perbandingan Algoritma Bee Colony dengan Algoritma Bee Colony Tabu List dalam Penjadwalan Flow Shop  

Oleh:

Sugioko, Andre

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI - atma jaya
Dalam koleksi: Metris: Jurnal Mesin, Elektro, Industri dan Sains vol. 14 no. 02 (Dec. 2013), page 113-120.
Topik: Scheduling. Bee Colony. Tabu List. Flow Shop; Makespan; JABFUNG-AS-FT-2015
Fulltext: Andre Sugioko 113-120 - Bernard.pdf (2.97MB)

Ketersediaan

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

Lihat Detail Induk

Isi artikel

This paper discusses the performance of Bee Colony algorithm integrated with the swap method and tabu list with Bee Colony algorithm. This research was based on the results of research by Chong in 2006. Which declared that the Bee Colony algorithm integrated with the swap method has a good performance. but cannot compete with the performance of Tabu Search. so the researchers will test whether integrating Bee Colony algorithm with swap method and tabu list will give better performance than Bee Colony algorithm or not. This research will use two study case flow shop scheduling problem. with objective function is minimum makespan to compare both algorithm's performance. The results Bee Colony- Tabu provide superior results at makespan values than Bee Colony algorithm. but not at computational lime.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali