Henry Pantas Panggabean Primary Author mixed material bibliography Bagian Serial Sigma jurnal sains dan Teknologi ind Indonesia

Index Artikel

Sumber artikel:Jurnal. Halaman: 27-35 As a NP-hard combinatorial optimisation problem job-shop scheduling can be solved quite well by simulated annealing (SA) algorithm. tHis paper prsents the aplikation of schrage algorithm to subtitute random generation method of initial solution in SAalgorithm to increase its performance in terms of solution cuality and camputation time. One-machine schedules produced by schrage algorithm are combined to form an initial job-shopsc hedule. 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 ane-machine schedule. Job-sob scheduling, one-machine scheduling, Simulated anealing, Schrage algorithm 378.0405 SIG 20 UPT Perpustakaan UM Koleksi Bahan Pustaka Perpustakaan UM 2 -45526 2013-02-07 00:00:00 2013-02-07 00:00:00 machine generated