skip to main content

PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA


Citation Format:
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

Fulltext View|Download

Article Metrics:

Article Info
Section: Research Article
Language : EN
Statistics: 821 8265
Share:

Last update: 2021-06-24 15:28:17

  1. Pattern Recognition of Batak Script Using Habbian Method

    Frinto Tambunan, Erwin Ginting, Edy Victor Haryanto, Muhammad Fauzi. 2020 8th International Conference on Cyber and IT Service Management (CITSM), 2020. doi: 10.1109/CITSM50537.2020.9268839
  2. Bank Indonesia Interest Rate Prediction and Forecast With Backpropagation Neural Network

    Rini Sovia, Musli Yanto, Rima Liana Gema, Rizki Fernando. 2018 International Conference on Information Technology Systems and Innovation (ICITSI), 2018. doi: 10.1109/ICITSI.2018.8695914

Last update: 2021-06-24 15:28:17

  1. Artificial fish swarm algorithm for job shop scheduling problem

    Pythaloka D.. 2015 3rd International Conference on Information and Communication Technology, ICoICT 2015, 2015. doi: 10.1109/ICoICT.2015.7231465