PENERAPAN ALGORITMA SIMULATED ANNEALING UNTUK MASALAH PENJADWALAN JOB SHOP STATIK
| Main Author: | SOLEHODIN, ACHMAD |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2009
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/10449/1/PENERAPAN__ALGORITMA_SIMULATED__ANNEALING_UNTUK_MASALAH_PENJADWALAN_JOB_SHOP_STATIK.pdf http://eprints.umm.ac.id/10449/ |
Daftar Isi:
- Job shop scheduling problem is problem of arranging series of jobs that will be process in number of machines to minimize the total amount of time used in finishing a group of jobs (Makespan). Directed graph representation used in modelling job shop scheduling problem. The method used to get solution the problem is Simulated Annealing algortihm. This method analogous with annealing process in physic. There are three parameters which influence annealing process in job shop scheduling problem. There are : neighbour, temperature, and acceptance probability limit. Algorithm used in comparing resulted simulated annealing algorithm is Priority Dispaching method support software Quant System (QS). From simulation data from 3-job 3-machines problem makespan resulted from simulated annealing algorithm is 374, while makespan resulted from QS is 385. From simulation data from 10-job 11-machines problem makespan resulted from simulated annealing algorithm is 50.37 hour, while makespan resulted from QS is 59.39 hour.