Implementasi Algoritma Genetika pada Penjadwalan Job Shop
In the industry to create a product is divided into several processes and each process requires a different machine to process during a certain time unit. If not scheduled properly, it will take a long time to produce. Scheduling is the process of determining a resource that will process the job with a certain order for a certain time. The more jobs and machines, the more difficult transfers. Good scheduling is who has the time or the completion of all work is often referred to (makespan) and the smallest waiting time machine. To obtain the best schedule quickly it takes a scheduling application that implements a genetic algorithm. This study uses metododologi software development Rational Unified Process. From the results of this study showed that the schedule generated by the genetic algorithm approach is best scheduling. This is evidenced by the results of tests resulted in the percentage accuracy of 94.3%.
 Kusumadewi, Sri. 2003. Artificial Intelligence (Teknik dan Aplikasinya). Graha Ilmu. Yogyakarta.
 James C. Chen, Cheng-Chun Wu, Chia-Wen Chen , Kou-Huang Chen. 2012. Flexible job shop scheduling with parallel machines using Genetic Algorithm and
Grouping Genetic Algorithm.Expert Systems with Applications 39 (2012) 10016– 10021.
 Yamada, Takeshi and Nakano, Ryohei.1997. Genetic Algorithms for Job-Shop Scheduling Problems. Proceedings of Modern Heuristic for Decision Support, pp.
 Sutojo, Mulyanto, dan Suhartono.2011.Kecerdasan Buatan. Andi Publiser. Yogyakarta.
 Weng, Wei, and Fujimura, Shigeru. Study and Application of Scheduling Method for Just-in-time Production in Flexible Job Shops. Proceedings of 2011 IEEE
 Cheol Min Joo, and Byung Soo.2013. Genetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activities.
Expert Systems with Applications 40 (2013) 3036–3043.
 Russel, S. and P. Norvig. 1995. Artificial Intelligence: A Modern Approach. Prentice Hall, New Jersey.
 Li Jun-Qing, Pan, Quan-Ke and Tasgetiren, Fatih. A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling with
maintenance activities. Applied Mathematical Modelling 38 (2014) 1111-1132
 Baykasoğlu, A., Hamzadayi, A., and Yelkenci, S., Testing the performance of teaching-learning basedoptimization (TLBO) algorithm on combinatorial
problems:Flow shop and job shop scheduling cases. Information Sciences (2014).
 Jia, Shuai and Zhi-Hua, Hu.2014. Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem. Computers & Operations Research
47 (2014) 11-26.
JATIS oleh http://jurnal.mdp.ac.id/index.php/jatisi disebarluaskan di bawah Lisensi Creative Commons Atribusi-BerbagiSerupa 4.0 Internasional.