Announcement
Starting on July 4, 2018 the Indonesian Publication Index (IPI) has been acquired by the Ministry of Research Technology and Higher Education (RISTEKDIKTI) called GARUDA Garba Rujukan Digital (http://garuda.ristekdikti.go.id)
For further information email to portalgaruda@gmail.com

Thank you
Logo IPI  
Journal > JURNAL MASYARAKAT INFORMATIKA > PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA

 

Full Text PDF (443 kb)
JURNAL MASYARAKAT INFORMATIKA
Vol 1, No 1 (2010): Jurnal Masyarakat Informatika
PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA
Article Info   ABSTRACT
Published date:
12 Dec 2010
 
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