使用Campbell Dudek Smith算法编写Sanjai Rina制作的优化计划

Annisa Yovinda
{"title":"使用Campbell Dudek Smith算法编写Sanjai Rina制作的优化计划","authors":"Annisa Yovinda","doi":"10.24036/unpjomath.v7i1.10902","DOIUrl":null,"url":null,"abstract":"Abstract — Kerupuk sanjai Rina business always run into lateness in product  delivery because they haven’t done production which will be deliver and delivery deadline only based on intuition. Sanjai Rina have need to establist a better production schedule so that be able to minimizing all product work time total. There are many ways to minimizing total of work time, one of them is using Campbell Dudek Smith (CDS) algorithm. The purpose of the research to know best outcome sanjai Rina production prosess scheduling using CDS algorithm. CDS algorithm obtain k iteration with different values. From k iteration, minimal value will be use to determine production thread. Sanjai Rina business have total time work all of product is 435,88 hours by sequence 1-2-3-4-5-6-7-8. From CDS algorithm iterations, obtain minimal scheduling by sequence 4-8-3-1-2-6-7-5 with total work time all of yhe product is 375,26 hours that will attain saving 60,22 hours time work.","PeriodicalId":244588,"journal":{"name":"Journal of Mathematics UNP","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimasi Penjadwalan Produksi Sanjai Rina Menggunakan Algoritma Campbell Dudek Smith\",\"authors\":\"Annisa Yovinda\",\"doi\":\"10.24036/unpjomath.v7i1.10902\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract — Kerupuk sanjai Rina business always run into lateness in product  delivery because they haven’t done production which will be deliver and delivery deadline only based on intuition. Sanjai Rina have need to establist a better production schedule so that be able to minimizing all product work time total. There are many ways to minimizing total of work time, one of them is using Campbell Dudek Smith (CDS) algorithm. The purpose of the research to know best outcome sanjai Rina production prosess scheduling using CDS algorithm. CDS algorithm obtain k iteration with different values. From k iteration, minimal value will be use to determine production thread. Sanjai Rina business have total time work all of product is 435,88 hours by sequence 1-2-3-4-5-6-7-8. From CDS algorithm iterations, obtain minimal scheduling by sequence 4-8-3-1-2-6-7-5 with total work time all of yhe product is 375,26 hours that will attain saving 60,22 hours time work.\",\"PeriodicalId\":244588,\"journal\":{\"name\":\"Journal of Mathematics UNP\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Mathematics UNP\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24036/unpjomath.v7i1.10902\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematics UNP","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24036/unpjomath.v7i1.10902","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

摘要:Kerupuk sanjai Rina的业务总是在产品交付方面遇到延迟,因为他们还没有完成生产,而交付和交付期限只是基于直觉。Sanjai Rina需要建立一个更好的生产计划,以便能够最大限度地减少所有产品的工作时间。最小化总工作时间的方法有很多,其中一种是使用坎贝尔杜德克史密斯算法。本研究的目的是了解三井丽娜生产过程调度使用CDS算法的最佳结果。CDS算法获得不同值的k次迭代。从k次迭代开始,将使用最小值来确定生产线程。三佳丽娜业务按顺序1-2-3-4-5-6-7-8总工作时间为435,88小时。从CDS算法的迭代中,得到排序为4-8-3-1-2-6-7-5的最小调度,所有产品的总工作时间为375,26小时,将节省60,22小时的工作时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimasi Penjadwalan Produksi Sanjai Rina Menggunakan Algoritma Campbell Dudek Smith
Abstract — Kerupuk sanjai Rina business always run into lateness in product  delivery because they haven’t done production which will be deliver and delivery deadline only based on intuition. Sanjai Rina have need to establist a better production schedule so that be able to minimizing all product work time total. There are many ways to minimizing total of work time, one of them is using Campbell Dudek Smith (CDS) algorithm. The purpose of the research to know best outcome sanjai Rina production prosess scheduling using CDS algorithm. CDS algorithm obtain k iteration with different values. From k iteration, minimal value will be use to determine production thread. Sanjai Rina business have total time work all of product is 435,88 hours by sequence 1-2-3-4-5-6-7-8. From CDS algorithm iterations, obtain minimal scheduling by sequence 4-8-3-1-2-6-7-5 with total work time all of yhe product is 375,26 hours that will attain saving 60,22 hours time work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信