Production Scheduling Using Mixed Integer Programming: Case of Bread Small and Medium Enterprise at Yogyakarta

Small and medium enterprise (SME) needs to apply effective scheduling in order to meet the demand schedule. This is done traditionally, though, it is necessary to allocate production resources to produce product variety such as bread. The fact shows that the order fulfillment is often delayed because of incorrect scheduling. This problem can be solved by making production scheduling that have a minimum completion time (makespan) as approached by using mixed integer programming (MIP). This study is proposed to build an effective scheduling for an SME on bread products by utilize MIP. The output is then compared to the serial machine scheduling method with CDS algorithm. Both methods are having an output in minimizing makespan. The results showed that with the proposed scheduling, the SME likely able to fulfill the whole order in time.