Detail Modifikasi Algoritma Bee Colony untuk Permasalahan Penjadwalan Flow Shop Bibliografi Author: SUGIJOKO, ANDRE ; Hidayat, Trifenaus Prabu (Advisor) Topik: Algoritma Bee Colony Bahasa: (ID )     Penerbit: Program Studi Teknik Industri Fakultas Teknik Unika Atma Jaya     Tempat Terbit: Jakarta    Tahun Terbit: 2010     Jenis: Theses - Undergraduate Thesis Fulltext: Andre Sugijoko's Undergraduate Theses.pdf (1.39MB; 63 download) Andre Sugijoko-PENDUKUNG.pdf (36.81KB; 4 download) Ketersediaan Perpustakaan Pusat (Semanggi) Nomor Panggil: FTI-570 Non-tandon: tidak ada Tandon: 1  Lihat Detail Induk Abstract In competition of the industrial world today requires increased productivity. One of the problems is the increased productivity of production scheduling. Production scheduling is an important task in terms of improving machine utilization, and reducing cycle time. Production scheduling can be solved using a heuristic approach. One of the heuristic approach is Bee Colony Algorithm. Bee Colony Algorithm is a custom application of bee colonies in search of flowers. Bee Colony Algorithm has usefulness in the search for solutions to complex problems such as scheduling. In this study proposed a modification in Forgaging level. The proposed modification is to use simple scheduling which commonly used. The function purpose of the research is minimizing makespan. Application for modification Bee Colony Algorithm using case from PT. ANUGRAHPRIMA PERDANA. Based on application modification Bee Colony Algorithm, modification in Forgaging level will make proces in waggle dance level uneffective, because solution from Forgaging level already optimum. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Lihat Sejarah Pengadaan  Konversi Metadata   Kembali

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