文章基本信息

标题：Production Time Optimization using Campbell Dudek Smith (CDS) Algorithm for Production Scheduling
本地全文：下载
作者：Chamdan Mashuri ; Ahmad Heru Mujianto ; Hadi Sucipto 等
期刊名称：E3S Web of Conferences
印刷版ISSN：2267-1242
电子版ISSN：2267-1242
出版年度：2019
卷号：125
页码：1-5
DOI：10.1051/e3sconf/201912523009
出版社：EDP Sciences
摘要：The production time optimization study used the Campbell Dudek smith (CDS) algorithm in the production process scheduling aimed at makespan optimization for engine operation to produce 12-size pan products, 14-size griddle, 16-size griddle, 18-size griddle, and 20-size griddle. The method applied by the Campbell Dudek and Smith (CDS) algorithm, CDS is a method used in flowshop-type scheduling developed from Johnson's rule that is able to minimize makespan 2 machines arranged in series. The CDS method is very suitable for production characters who apply the machine sequence to the production process. CDS produces several iterations that have makespan values, from the few iterations the most minimum makespan value is obtained to determine the order of products to be produced. This research produces an application that can schedule products to be produced by the machine automatically. From the results of testing with a total production of 12 pieces on each product with repetitions of 6 times, the minimum makespan value is 210.12 minutes with a work order of 20, grid 18, griddle 16, griddle 14, and griddle 12. Accuracy of results Application testing showed 99.99% for the first time and 99.96% for the second time when compared to manual calculations.
其他摘要：The production time optimization study used the Campbell Dudek smith (CDS) algorithm in the production process scheduling aimed at makespan optimization for engine operation to produce 12-size pan products, 14-size griddle, 16-size griddle, 18-size griddle, and 20-size griddle. The method applied by the Campbell Dudek and Smith (CDS) algorithm, CDS is a method used in flowshop-type scheduling developed from Johnson's rule that is able to minimize makespan 2 machines arranged in series. The CDS method is very suitable for production characters who apply the machine sequence to the production process. CDS produces several iterations that have makespan values, from the few iterations the most minimum makespan value is obtained to determine the order of products to be produced. This research produces an application that can schedule products to be produced by the machine automatically. From the results of testing with a total production of 12 pieces on each product with repetitions of 6 times, the minimum makespan value is 210.12 minutes with a work order of 20, grid 18, griddle 16, griddle 14, and griddle 12. Accuracy of results Application testing showed 99.99% for the first time and 99.96% for the second time when compared to manual calculations.
其他关键词：Optimization ; production ; scheduling ; CDS ; makespan