Penjadwalan Produksi dengan Menggunakan Algoritma Simulated Annealing

Santoso, Leo Willyanto and GUNTARA, JONATHAN and Sandjaja, Iwan Njoto (2012) Penjadwalan Produksi dengan Menggunakan Algoritma Simulated Annealing. Jurnal Ilmiah Ilmu Komputer, 9 (1). pp. 1-6. ISSN 1412-9523

[img] PDF
Download (2040Kb)


    X company is a company which produces incense as their main goal. They are using pre–ordering system to do their production process from semi-finished goods to finished goods. By the reason of the same steps of process in all goods production, this process can be categorized as a flowshop. X company still using the FIFO method, so many bottleneck still occured. In the end, it will affect the increase in makespan. Therefore scheduling application with Simulated Annealing Alogorithm is needed to minimize the bottleneck, so the makespan will automatically decrease. Simulated Annealing Algorithm is one of the heuristic method in search of the optimal solution. Optimal solution was obtained by doing job switching with some unique rule called pairwise exchange. Before doing it, we must look for an initial solution with Shortest Processing Time (SPT), Longest Processing Time (LPT), dan First Job Smallest First (FJSF) methods. Initial solution will also be found by FIFO and Brute Force. Experimental result shows that Simulated Annealing Scheduling with 15 jobs (average value of X company’s job order in 1 week) able to save more than 300 minutes compared to FIFO.

    Item Type: Article
    Uncontrolled Keywords: production scheduling, scheduling, simulated annealing
    Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Divisions: Faculty of Industrial Technology > Informatics Engineering Department
    Depositing User: Admin
    Date Deposited: 29 Jun 2013 23:46
    Last Modified: 02 Sep 2013 20:13
    URI: http://repository.petra.ac.id/id/eprint/16431

    Actions (login required)

    View Item