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

被引：1

作者：

Hastuti, Ratriani Puspita ^{[1
]}

Yuliando, Henry ^{[1
]}

Aziz, Ibnu Wahid Fakhrudin ^{[1
]}

机构：

[1] Univ Gadjah Mada, Fac Agr Technol, Dept Agroind Technol, Yogyakarta, Indonesia

来源：

International Conference on Agro-Industry (IcoA): Sustainable and Competitive Agro-Industry for Human Welfare Yogyakarta-INDONESIA 2014 | 2015年 / 3卷

关键词：

Flow shop; Mixed Integer Programming; Campbell; Dudek; and Smith (CDS) algorithm; Scheduling;

D O I：

10.1016/j.aaspro.2015.01.041

中图分类号：

F3 [农业经济];

学科分类号：

0202 ; 020205 ; 1203 ;

摘要：

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. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

引用

页码：211 / 215

页数：5