Logo

Penjadwalan Dengan Algoritma Disjunctive ProgrammingPada Permasalahan Job Shop (Studi Kasus Di U.D. Pari Jaya Makmur)

Octavia, Tanti and Widyadana, I Gede Agus and Tjondrokusumo, Garry (2014) Penjadwalan Dengan Algoritma Disjunctive ProgrammingPada Permasalahan Job Shop (Studi Kasus Di U.D. Pari Jaya Makmur). In: Seminar Nasional Teknik Industri, 08-11-2014 - 08-11-2014, Surabaya - Indonesia.

[img] PDF
Download (165Kb)
    [img]
    Preview
    PDF (cek plagiasi)
    Download (1342Kb) | Preview
      [img]
      Preview
      PDF (peerreview)
      Download (932Kb) | Preview

        Abstract

        Scheduling is one of the important decisions to keep manufacture competitiveness.This paper attempts to compare two algorithms, which are Disjunctive Programming Algorithm and Reschedul¬ing Procedure Algorithm, in order to minimize makespanfor UD. Pari Jaya Makmur. The result shows that Rescheduling Procedure Algorithm gives the smaller makespanthan Disjunctive Algorithm. The idle time on Rescheduling Procedure Algorithm sche¬dule is 13452.06 seconds on the third machine, while the idle time on Disjunctive Pro¬gramming Algorithm schedule is 16701,556 seconds on the second machine.

        Item Type: Conference or Workshop Item (Paper)
        Uncontrolled Keywords: Disjunctive Programming, Rescheduling Procedure, IdleTime, MakespanMinimization.
        Subjects: T Technology > TA Engineering (General). Civil engineering (General)
        Divisions: Faculty of Industrial Technology > Industrial Engineering Department
        Depositing User: Admin
        Date Deposited: 27 Nov 2014 21:32
        Last Modified: 27 Nov 2020 06:38
        URI: http://repository.petra.ac.id/id/eprint/16996

        Actions (login required)

        View Item