Penerapan Algoritma Cross Entropy–Genetic Algorithm Untuk Optimasi Makespan Pada Penjadwalan Flow Shop

Authors

  • Paranditus Paranditus Universitas Tanjungpura
  • Evi Noviani Universitas Tanjungpura
  • Yudhi Yudhi Universitas Tanjungpura

DOI:

https://doi.org/10.25077/jmua.13.1.1-13.2024

Keywords:

Penjadwalan flow shop, Makespan, Cross Entropy–Genetic Algorithm

Abstract

Penjadwalan flow shop merupakan jenis penjadwalan produksi dimana setiap pekerjaan yang diproses seluruhnya mengalir pada proses yang sama, dengan tujuan untuk mencari urutan pekerjaan yang dapat mengoptimalkan nilai makespan. Penelitian ini bertujuan untuk mencari kombinasi urutan pekerjaan dengan nilai makespan yang optimal pada CV Bestone Indonesia. Permasalahan penjadwalan flow shop dapat diselesaikan dengan menggunakan Cross Entropy–Genetic Algorithm (CEGA). Algoritma CEGA bekerja dengan cara membangkitkan sampel awal (N) secara acak, kemudian sampel selanjutnya diperoleh dari hasil proses crossover dan mutasi dengan parameter berupa parameter kejarangan (Ï), koefisien penghalusan (α), parameter crossover (Pc) dan parameter pemberhentian (β). Berdasarkan pengolahan data yang telah dilakukan menggunakan Algoritma CEGA, diperoleh urutan pekerjaan 3, pekerjaan 1, pekerjaan 4, pekerjaan 2 dan urutan pekerjaan 3, pekerjaan 4, pekerjaan 1, pekerjaan 2 serta nilai makespan sebesar 389116,52 detik.

References

Ginting, R., 2009, Penjadwalan Mesin, Graha Ilmu, Yogyakarta

Haming, M. dan Nurnajamuddin, M., 2014, Manajemen Produksi Modern Operasi Manufaktur dan Jasa, Buku 2, Cahaya Prima Sentosa, Jakarta

Arkeman, Y., Seminar, B., dan Gunawan, H., 2012, Algoritma Genetika Teori

dan Aplikasinya untuk Bisnis dan Industri, IPB Press, Bogor

Kurniawati, A. dan Karim, S., 2016, Penjadwalan Produksi Flow Shop dengan Metode Ignal-Scharge dan Algoritma Nawaz, Enscore dan Ham (NEH) di CV. Bestone Indonesia, jurnal Sains, Teknologi dan Industri, 13: 229 – 241

Widodo, S., Santoso, B. dan Siswanto, E., 2014. Pendekatan Algoritma Cross Entropy–Genetic Algorithm untuk Menurunkan Makespan Pada Penjadwalan Flow Shop, JEMIS, 2: 41 – 49

Nurkhalida, L. dan Santosa, B., 2012, Pendekatan Algoritma Cross Entropy–Genetic Algorithm Pada Permasalahan Multi Objective Job Shop Scheduling, (serial online) Available at: https//www.researchgate.net/publication/267976436-

pendekatan-cross-entropy-genetic-algorithmn-pada-permasalahan-multi-objective-job-shop-scheduling. Pdf, (14 Mei 2021)

Syarif, A., 2014, Algoritma Genetika Teori dan Aplikasi, Edisi ke-2, Graha Ilmu, Yogyakarta

Boer, D., Kroese, D.P., Mannor, S., and Rubinstein, R.Y., 2005, A tutorial on the Cross-Entropy Method,Annals of Operations Research, 134: 19 – 67

Bashori, H.,Pratikto, dan Sugiono, 2015, Penjadwalan Flow Shop dengan Penerapan Algoritma Cross Entropy-Genetic Algorithm (CEGA) untuk Meminimasi Makespan, JEMIS, 3: 35 – 42

Muharni, Y., Saeful M, A. I., dan Rubyanti, T. E., 2019, Penjadwalan Flow Shop Mesin Paralel Menggunakan Metode Longest Processing Time dan Cross Entropy-Genetic Algorithm Pada Pembuatan Produk Steel Bridge B-60, Jurnal Ilmiah Teknik Industri,7: 213 – 225

Bahsori, H, 2015, Upaya Meminimasi Makespan dengan Penerapan Algoritma Cross Entropy Pada Penjadwalan Flow Shop, Widya Teknika, 23: 10 – 14

Alfandianto, A., Nugroho, y. A., dan Setiafindari, W., 2017, Penjadwalan Produksi Menggunakan Pendekatan Algoritma Genetika di PT Pertani (PERSERO) Cabang D.I Yogyakarta, Jurnal DISPROTEK, 2: 1 – 7

Suprayogi, D. A., dan Mahmudy, W. F., 2014, Penerapan Algoritma Genetika Traveling Salesman Problem with Time Window, Jurnal Buana Informatika, 6: 121 – 130

Utama, D. M., Ardiansyah, L. R., dan Garside, A. K., 2019, Penjadwalan Flow Shop untuk Meminimasi Total Tardiness

Menggunakan Algoritma Cross Entropy-Genetic Algorithmn, Jurnal Optimasi Sistem Industri, 18: 133 – 141

Saputro, N., dan Yento, 2004, Pemakaian Algoritma Genetik untuk Penjadwalan Jop Shop Dinamis Non Deterministik, Jurnal Teknik Industri, 6: 61 – 70

Downloads

Additional Files

Published

31-01-2024

Issue

Vol. 13 No. 1 (2024)

Section

Articles

License

All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.

Copyright Holder

The copyright of all articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND). This applies to all published versions, including the HTML and PDF formats of the articles.

Author Rights

While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:

  • Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
  • Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.

Creative Commons License (CC BY-SA)

Under the terms of the CC BY-SA license, users are free to:

  • Share: Copy and redistribute the material in any medium or format.
  • Adapt: Remix, transform, and build upon the material for any purpose, even commercially.

However, the following conditions apply:

  • Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
  • ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.

For more information about the CC BY-SA license, please visit the Creative Commons website.

Third-Party Content

If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.

Copyright and Licensing Information Display

The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.

No "All Rights Reserved"

As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.

Â