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.

Downloads

Download data is not yet available.

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

How to Cite

Paranditus, P., Noviani, E., & Yudhi, Y. (2024). Penerapan Algoritma Cross Entropy–Genetic Algorithm Untuk Optimasi Makespan Pada Penjadwalan Flow Shop. Jurnal Matematika UNAND, 13(1), 1–13. https://doi.org/10.25077/jmua.13.1.1-13.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 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.

Copyright Holder

The copyright of 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), in accordance with the journal's stated copyright policy.

Author Rights

Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:

  • Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.

  • Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.

  • Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.

Creative Commons License (CC BY-SA 4.0)

Under the CC BY-SA 4.0 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, including commercial purposes.

These permissions are subject to the following conditions:

  • Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.

  • ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.

  • No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.

For more information about the CC BY-SA 4.0 license, please visit:

https://creativecommons.org/licenses/by-sa/4.0/

Third-Party Content

Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.

Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.

Copyright and Licensing Information

Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.