PENERAPAN ALGORITMA ANT COLONY OPTIMIZATION (ACO) PADA JOB SHOP SCHEDULING PROBLEM (JSSP) DI PT. SIEMENS INDONESIA (CILEGON FACTORY)

  • Widyawati Widyawati Universitas Banten Jaya
Keywords: Ant Colony Optimization (ACO), Job Shop Scheduling Problem (JSSP), Makespan Time, Non – Deterministic, Scheduling

Abstract

Fabrication process is often disrupted by non–deterministic job, this create a problem in the Pre-Fabrication department schedule because often the manufacture of raw material for non-deterministic job should given priority. This problem also affected by the existing system which is not yet fully developed to solve the problem of optimize rescheduling master line (seen from total makespan time). Ant Colony Optimization (ACO) variant Ant System (AS) was proposed to solve Job Shop Scheduling Problem (JSSP) with the objective to propose the best schedule that give shortest makespan. The algorithm tested to perform scheduling of 5 projects (consist of 10 parts) as the initial job, and another 2 projects (consist of 4 parts) as the non-deterministic job. For the initial job, makespan was 287 days and after the arrival of non-deterministic job, makespan was 362 days compare with the actual manufacturing time (7 project consist of 14 parts) which is ± 511 days

References

Al Salami, N. M. (2009). Ant Colony Optimization Algorithm. UbiCC Journal, Volume 4, Number 3, 823-826.
Anamisa, D. R., & Djunaidy, A. (2014). Penyelesaian Penjadwalan Mata Kuliah Menggunakan Hibridisasi Algoritma Genetika dan Algoritma Koloni Semut. JUTI, Volume 12, Nomor 1, 15-20.
Aprilius, W., Augustino, L., & M. H., O. Y. (2013). Implementasi Algoritma MAX-MIN Ant System pada Penjadwalan Mata Kuliah. ULTIMATICS, Vol. V, No. 2, ISSN 2085-4552, 48-53.
Ariesta, Y. (2012). Penerapan Ant Colony System Pada Vehicle Routing Problem Untuk Menentukan Rute Distribusi Terpendek. Jakarta: Jurusan Teknik Industri, Fakultas Teknologi Industri, Universitas Trisakti.
Astuti, M. (2013). Studi Penjadwalan Job Shop untuk Meminimalkan Waktu Keseluruhan Menggunakan Pendekatan Algoritma Artificial Immune System. Yogyakarta: Volume V, Nomor 1.
Çalis, B., & Bulkan, S. (2013). A research survey: review of AI solution strategies of job shop scheduling problem. Journal of Intelligent Manufacturing (DOI 10.1007/s10845-013-0837-8).
Dorigo, M. (1996). The Ant System: Optimization by a Colony Of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics–Part B, Vol.26, No.1, 1996, pp.1-13, 1-26.
Dorigo, M., Di Caro, G., & Gambardella, L. (1999). Ant Algorithms for Discrete Optimization.
Flórez, E., Gómez, W., & Bautista, M. (2013). An Ant Colony Optimization Algorithm For Job Shop Scheduling Problem. International Journal of Artificial Intelligence & Applications (IJAIA), Vol. 4, No. 4, 53-66.
Jones, A., & Rabelo, L. (1998). Survey of Job Shop Scheduling Techniques.
Laksono, A. (2009). Algoritma Ant Colony Optimization (ACO) Untuk Menyelesaikan Traveling Salesman Problem (TSP). Semarang: Program Studi Matematika Jurusan Matematika, Fakultas MIPA, Universitas Diponegoro.
Published
2018-09-06
How to Cite
Widyawati, W. (2018). PENERAPAN ALGORITMA ANT COLONY OPTIMIZATION (ACO) PADA JOB SHOP SCHEDULING PROBLEM (JSSP) DI PT. SIEMENS INDONESIA (CILEGON FACTORY). Jurnal Sistem Informasi Dan Informatika (Simika), 1(01), 35-51. https://doi.org/10.47080/simika.v1i01.37

Most read articles by the same author(s)

1 2 > >>