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

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.