PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA

Satriyo Adhy; Kushartantya Kushartantya

doi:10.14710/jmasif.1.1.75

How to cite (IEEE): S. Adhy, and K. Kushartantya, "PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA," JURNAL MASYARAKAT INFORMATIKA, vol. 1, no. 1, pp. 31-42, Dec. 2010. https://doi.org/10.14710/jmasif.1.1.75

How to cite (APA): Adhy, S., & Kushartantya, K. (2010). PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA. JURNAL MASYARAKAT INFORMATIKA, 1(1), 31-42. https://doi.org/10.14710/jmasif.1.1.75

How to cite (BCREC): Adhy, S., Kushartantya, K. (2010). PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA. JURNAL MASYARAKAT INFORMATIKA, 1 (1), 31-42 (doi:10.14710/jmasif.1.1.75)

How to cite (Chicago): Adhy, Satriyo, and Kushartantya Kushartantya. "PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA." JURNAL MASYARAKAT INFORMATIKA 1, no. 1 (2010): 31-42. Accessed March 24, 2023. https://doi.org/10.14710/jmasif.1.1.75

How to cite (Vancouver): Adhy S, Kushartantya K. PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA. JURNAL MASYARAKAT INFORMATIKA [Online]. 2010 Dec;1(1):31-42. https://doi.org/10.14710/jmasif.1.1.75.

How to cite (Harvard): Adhy, S., and Kushartantya, K., 2010. PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA. JURNAL MASYARAKAT INFORMATIKA, [Online] Volume 1(1), pp. 31-42. https://doi.org/10.14710/jmasif.1.1.75 [Accessed 24 Mar. 2023].

How to cite (MLA8): Adhy, Satriyo, and Kushartantya Kushartantya. "PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA." JURNAL MASYARAKAT INFORMATIKA, vol. 1, no. 1, 12 Dec. 2010, pp. 31-42 , https://doi.org/10.14710/jmasif.1.1.75. Accessed 24 Mar. 2023.

BibTex Citation Data :

@article{JMASIF75,
    author = {Satriyo Adhy and Kushartantya Kushartantya},
    title = {PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA},
    journal = {JURNAL MASYARAKAT INFORMATIKA},
  volume = {1},
    number = {1},
    year = {2010},
    keywords = {},
    abstract = {      Normal   0           false   false   false     EN-US   X-NONE   X-NONE                             MicrosoftInternetExplorer4                                                                                                                                                                                                                                                                                                                                   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  },
   issn = {2777-0648},   pages = {31--42}  doi = {10.14710/jmasif.1.1.75},
    url = {https://ejournal.undip.ac.id/index.php/jmasif/article/view/75}
}

Refworks Citation Data :

@article{{JMASIF}{75}, author = {Adhy, S., Kushartantya, K.}, title = {PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA}, journal = {JURNAL MASYARAKAT INFORMATIKA}, volume = {1}, number = {1}, year = {2010}, doi = {10.14710/jmasif.1.1.75}, url = {https://ejournal.undip.ac.id/index.php/jmasif/article/view/75} }