Perbandingan Kinerja Operasi Swap dan Shift dalam Algoritma Simulated Annealing untuk Penjadwalan Flowshop SDST-NIQ  

Oleh:

The, Jin Ai

Jenis: Article from Journal - ilmiah nasional
Dalam koleksi: Jurnal Teknologi Industri vol. 9 no. 1 (Jan. 2005), page 53-60.
Topik: Simulated Annealing; SDST-NIQ Flowshop; Swap Operation; Shift Operation; Perfomance Testing

Ketersediaan

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

Lihat Detail Induk

Isi artikel

This paper present an application of simolated annealing (SA) algorithm to solve one elass of flowshop sequencing problem that called sequence dependent setup time - no intermediate queue (SDST-NIQ) problem. In each interation step of any SA algorithm, a process to generate and choose neighborhood of current solution is reqired. Swap and shift operation can be used as this process. To compare the performance of each operation at the SA algorithm for SDST-NIQ flowshop problem, a series of computational experiment being conducted at several combinations of problem size (number of machines and number of jobs) that randomly generated. The result of this experiment is shift operation tends to give better solution but have longer computational time than swap operation.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali