Penyelesaian Penjadwalan Flexible Job Shop Untuk Minimasi Due Windows dengan Algoritma Genetika
DOI:
https://doi.org/10.59141/jiss.v2i06.326Keywords:
due windows, flexible job shop; genetika.Abstract
Flexible Job Shop (FJSP) adalah pengembangan dari job shop dimana terdapat lebih dari satu mesin yang dapat memproses suatu pekerjaan. Penelitian bertujuan untuk memodelkan dan menyelesaikan FJSP dengan fungsi tujuan due windows dimana tiap-tiap pekerjaan harus selesai dalam suatu rentang waktu. Metode yang digunakan dalam penelitian ini adalah metode Algoritma Genetika. Hasil yang diperoleh adalah penjadwalan dalam bentuk Gantt Chart yang memiliki nilai penalti yang minimum.
Downloads
Published
2021-06-21
How to Cite
Tampubolon, F. (2021). Penyelesaian Penjadwalan Flexible Job Shop Untuk Minimasi Due Windows dengan Algoritma Genetika. Jurnal Indonesia Sosial Sains, 2(06), 894–903. https://doi.org/10.59141/jiss.v2i06.326
Issue
Section
Articles
License
Copyright (c) 2021 Ferdinan Tampubolon
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike 4.0 International. that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
