Jurnal Sistem informasi dan informatika (SIMIKA)
Vol 1 No 01 (2018): Jurnal Sistem Informasi dan Informatika (SIMIKA)

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

Widyawati Widyawati (Universitas Banten Jaya)



Article Info

Publish Date
06 Sep 2018

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

Copyrights © 2018






Journal Info

Abbrev

jsii

Publisher

Subject

Computer Science & IT

Description

Jurnal SIMIKA diterbitkan oleh Program Studi Sistem Informasi Fakultas Ilmu Komputer Universitas Banten Jaya. Jurnal SIMIKA Volume 1 Nomor 1 terbit pada bulan Agustus 2018. Jurnal SIMIKA diterbitkan dalam rentang waktu 6 bulan yang artinya dua kali dalam setahun yaitu di bulan Februari dan Agustus. ...