Alogaritma Schrage untuk Inisialisasi Solusi Awal Simulated Annealing dalam Masalah Job Shop  

Oleh:

Panggabean, Henry Pantas

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI
Dalam koleksi: SIGMA: Jurnal Sains dan teknologi vol. 7 no. 1 (Jan. 2004), page 27-35.
Topik: Schrage algorithm; one-machine scheduling; job-shop scheduling; simulated annealing

Ketersediaan

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

Lihat Detail Induk

Isi artikel

As a NP-hard combinatorial optimization problem, job-shop schedulling can be solved quite well by simulated annealing (SA) algorithm. This paper presents the application of Schrage algorithm to substitute random generation method of ini tial solution in SA algorithm to increase its performance in terms of solution quality and computation time. One-machine schedules produced by Schrage algorithm are combined to form an initial job-shop schedule. Program runs prove that this modification yields a better result in solving job-shop problem. The strong point of Schrage algorithm is its nature to take into account the order of head and tail value of each operation to build a good initial one-machine schedule.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali