PENJADWALAN PRODUKSI MENGGUNAKAN MIXED INTEGER PROGRAMMING (MIP) PADA UKM ROTI BANGKIT YOGYAKARTA

Bangkit Bread SME is a bread producer with various flavors namely mocca, strawberry, coconut, chocolate, and choco-nut. Scheduling has an important role for this SME because the production is based on consumer demand. The production process in this SME is flow shop and the operation takes long time which begin at 7 a.m. till 5 a.m. in the next day. However, demand fulfillment is often delayed because scheduling that being used hasn�t right. Thus, necessary to propose production scheduling to minimize completion time. Proposed scheduling used Mixed Integer Programming (MIP). Otherwise, this research also used the comparision method that was serial machine scheduling method such as Campbell, Dudek, Smith (CDS) algorithm. Job sequencing using MIP and CDS algorithm were done to minimize completion time (makespan) of all job, so this SME could fulfill the completion deadline. Furthermore, the proposed scheduling and actual scheduling were simulated by optimal demand which was determined through newsvendor problem, then the results were compared. Scheduling using MIP and CDS algorithm had same result which was 27466.71 seconds. The results of simulation period 1 showed that proposed scheduling had minimum makespan, the value was 79366.9 seconds or 22.0 hours, while the makespan of actual scheduling was 81811.4 seconds or 22.7 hours. The result of period 2 showed that proposed scheduling had minimum makespan, the value was 77373.27 seconds or 21.5 hours, while the makespan of actual scheduling was 80544.30 seconds or 22.4 hours