EUVIMEDEUVIMED entdecken
Crossref

PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA

Satriyo Adhy, Kushartantya Kushartantya

JURNAL MASYARAKAT INFORMATIKA · 2010

DOI: 10.14710/jmasif.1.1.75 ↗

Kurz gefasst

Fachartikel in der Zeitschrift JURNAL MASYARAKAT INFORMATIKA, 2010. Verfasst von Satriyo Adhy und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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

Zitieren

APA

Adhy, S., & Kushartantya, K. (2010). PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA. JURNAL MASYARAKAT INFORMATIKA. https://doi.org/10.14710/jmasif.1.1.75

Vancouver

Adhy S, Kushartantya K. PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA. JURNAL MASYARAKAT INFORMATIKA. 2010. doi:10.14710/jmasif.1.1.75

BibTeX
@article{Adhy2010,
  author = {Adhy, Satriyo and Kushartantya, Kushartantya},
  title = {PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA},
  journal = {JURNAL MASYARAKAT INFORMATIKA},
  year = {2010},
  doi = {10.14710/jmasif.1.1.75}
}
Kostenlos starten →