Optimization of production process scheduling at Mataram Convection using the Campbell-Dudek and Smith method and the Ho and Chang method

Muhammad Ahladi Yunus, M. Marwan, Muhammad Rijal Alfian
{"title":"Optimization of production process scheduling at Mataram Convection using the Campbell-Dudek and Smith method and the Ho and Chang method","authors":"Muhammad Ahladi Yunus, M. Marwan, Muhammad Rijal Alfian","doi":"10.19184/mims.v23i1.36403","DOIUrl":null,"url":null,"abstract":"Konveksi Mataram (Djagoan Kaos dan Seragam) is one of the industries engaged in the manufacture of various types of clothing models with fabric as the basic material. So far, the scheduling method used by the company is the First Come First Serve method, in which the completion of production is based on order-to-order data. In this case, with high order intensity, companies often experience difficulties in completing orders according to a predetermined pick-up time. The problems experienced by the company were caused by the production process scheduling that was not optimal. Based on the problems encountered, the purpose of this research is to obtain the optimal scheduling sequence by determining the smallest makespan (minimum total completion time) of the application of the method to the production process. The methods used in this study are the Campbell-Dudek and Smith method and the Ho and Chang method and from these two methods, it is known that the smallest production process is optimal. Based on the results of calculations using the Campbell-Dudek and Smith method, the optimal scheduling sequence with the smallest makespan is 39163 minutes or the production process will be completed in 73 working days. While the results of calculations using the Ho and Chang method obtained the optimal scheduling sequence with the smallest makespan of 38660.50 minutes or the production process will be completed in 72 working days. From the makespans of the two methods, the Ho and Chang method is superior to the Campbell-Dudek and Smith method with a difference of 502.50 minutes or about 1 working day, whereas when compared to the company's initial method, namely First Serve First Come with a makespan of 43025.50 minutes, the HC method can make completion time efficient with a difference of 4365 minutes or about 8 working days. \nKeywords: Campbell-Dudek and Smith methods, first come first serve, Ho and Chang, makespan, production schedulingMSC2020: 90B30","PeriodicalId":264607,"journal":{"name":"Majalah Ilmiah Matematika dan Statistika","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Majalah Ilmiah Matematika dan Statistika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/mims.v23i1.36403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Konveksi Mataram (Djagoan Kaos dan Seragam) is one of the industries engaged in the manufacture of various types of clothing models with fabric as the basic material. So far, the scheduling method used by the company is the First Come First Serve method, in which the completion of production is based on order-to-order data. In this case, with high order intensity, companies often experience difficulties in completing orders according to a predetermined pick-up time. The problems experienced by the company were caused by the production process scheduling that was not optimal. Based on the problems encountered, the purpose of this research is to obtain the optimal scheduling sequence by determining the smallest makespan (minimum total completion time) of the application of the method to the production process. The methods used in this study are the Campbell-Dudek and Smith method and the Ho and Chang method and from these two methods, it is known that the smallest production process is optimal. Based on the results of calculations using the Campbell-Dudek and Smith method, the optimal scheduling sequence with the smallest makespan is 39163 minutes or the production process will be completed in 73 working days. While the results of calculations using the Ho and Chang method obtained the optimal scheduling sequence with the smallest makespan of 38660.50 minutes or the production process will be completed in 72 working days. From the makespans of the two methods, the Ho and Chang method is superior to the Campbell-Dudek and Smith method with a difference of 502.50 minutes or about 1 working day, whereas when compared to the company's initial method, namely First Serve First Come with a makespan of 43025.50 minutes, the HC method can make completion time efficient with a difference of 4365 minutes or about 8 working days. Keywords: Campbell-Dudek and Smith methods, first come first serve, Ho and Chang, makespan, production schedulingMSC2020: 90B30
利用Campbell-Dudek和Smith方法和Ho和Chang方法对Mataram对流生产过程调度进行优化
Konveksi Mataram (Djagoan Kaos dan Seragam)是一家以面料为基本材料从事各类服装模型制造的企业。到目前为止,该公司使用的调度方法是先到先得的方法,其中生产的完成是基于订单到订单的数据。在这种情况下,由于订单强度高,企业通常难以按照预定的取货时间完成订单。该公司遇到的问题是由于生产过程调度不优化造成的。基于所遇到的问题,本研究的目的是通过确定将该方法应用于生产过程的最小makespan(最小总完成时间)来获得最优调度顺序。本研究使用的方法是Campbell-Dudek and Smith方法和Ho and Chang方法,从这两种方法中,我们知道最小的生产过程是最优的。根据Campbell-Dudek和Smith方法的计算结果,最大完工时间最小的最优调度顺序为39163分钟,即生产过程在73个工作日内完成。而采用Ho和Chang方法的计算结果得到最大完工时间最小为38660.50分钟的最优调度顺序,即生产过程在72个工作日内完成。从两种方法的完工时间来看,Ho和Chang方法优于Campbell-Dudek和Smith方法,相差502.50分钟,约为1个工作日,而HC方法与公司最初的First Serve First Come方法相比,完工时间相差4365分钟,约为8个工作日。关键词:Campbell-Dudek和Smith方法,先到先得,Ho和Chang,完工时间,生产调度
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信