Jurnal Masyarakat Informatika
Vol 1, No 1 (2010): Jurnal Masyarakat Informatika

PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA

Adhy, Satriyo (Unknown)
Kushartantya, Kushartantya (Unknown)



Article Info

Publish Date
12 Dec 2010

Abstract

Job Shop Scheduling Problem (JSP) is a problem of work scheduling that can be describe by one or several job that have to be done by one or several source, each job contain of several operation that has to be done without interuption in several time and spesific source. Many kind algorithm can be use to solve JSP, one of them is genetic algorithm. Genetic Algorithm use in this final project to solve JSP. Genetic algorithm step begin with individual representation, initial population, reproduction and selection process, crossover gen, mutation gen and evaluation. Solving JSP with genetic algorithm can give a schedule of job in source with optimal time process, then Delphi 6 software use to make the solving program.   Key Word : Job Shop Scheduling Problem (JSP), Genetic Algorithm, Delphi 6

Copyrights © 2010






Journal Info

Abbrev

jmasif

Publisher

Subject

Computer Science & IT

Description

JURNAL MASYARAKAT INFORMATIKA - JMASIF is a Journal published by the Department of Informatics, Universitas Diponegoro invites lecturers, researchers, students (Bachelor, Master, and Doctoral) as well as practitioners in the field of computer science and informatics to contribute to JMASIF in the ...