{"title":"基于Campbell Dudek Smith算法(CDS)的PT OSIN启发式调度优化","authors":"Raihan Afif Makarim, Apid Hapid Maksum, Muhamad Taufiq Rachmat","doi":"10.25124/jrsi.v10i01.583","DOIUrl":null,"url":null,"abstract":"PT OSIN is a company that runs a business in the automotive manufacturing sector. The company applies a flow shop production model whose production pattern is line to line in series using the First Come First Serve production scheduling method. The problem with the FCFS method which is considered to have not reached the optimal enough in meeting uncertain product demands, causing delays in the production schedule, which has an impact on the flow or distribution of goods and can lead to increased production in activities. The proposed improvement method is made to optimize production scheduling, focusing on minimizing the makespan values in the scheduling system's order. This study uses a heuristic approach to the Campbell, Dudek, Smith (CDS) algorithm in overcoming scheduling problems. The CDS method is a production scheduling heuristic method developed from the Johnson algorithm in obtaining several sequences of 6 types of work processes at the work center which aims to analyze the total time for each processing process (makespan). Comparing the two methods using the FCFS method by sorting the scheduling according to the order of the initial order time produces a total value of 2,408.75 minutes, while using the CDS algorithm which uses 5 iterations produces a minor matter of 881.3 minutes. Comparing the results obtained by applying the scheduling system with the CDS method can be used as a proposed improvement in overcoming the delay in delivery and the production scheduling process.","PeriodicalId":471454,"journal":{"name":"JRSI : Jurnal Rekayasa Sistem & Industri","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization of Scheduling using Heuristic Approach with Campbell Dudek Smith Algorithm (CDS) at PT OSIN\",\"authors\":\"Raihan Afif Makarim, Apid Hapid Maksum, Muhamad Taufiq Rachmat\",\"doi\":\"10.25124/jrsi.v10i01.583\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PT OSIN is a company that runs a business in the automotive manufacturing sector. The company applies a flow shop production model whose production pattern is line to line in series using the First Come First Serve production scheduling method. The problem with the FCFS method which is considered to have not reached the optimal enough in meeting uncertain product demands, causing delays in the production schedule, which has an impact on the flow or distribution of goods and can lead to increased production in activities. The proposed improvement method is made to optimize production scheduling, focusing on minimizing the makespan values in the scheduling system's order. This study uses a heuristic approach to the Campbell, Dudek, Smith (CDS) algorithm in overcoming scheduling problems. The CDS method is a production scheduling heuristic method developed from the Johnson algorithm in obtaining several sequences of 6 types of work processes at the work center which aims to analyze the total time for each processing process (makespan). Comparing the two methods using the FCFS method by sorting the scheduling according to the order of the initial order time produces a total value of 2,408.75 minutes, while using the CDS algorithm which uses 5 iterations produces a minor matter of 881.3 minutes. Comparing the results obtained by applying the scheduling system with the CDS method can be used as a proposed improvement in overcoming the delay in delivery and the production scheduling process.\",\"PeriodicalId\":471454,\"journal\":{\"name\":\"JRSI : Jurnal Rekayasa Sistem & Industri\",\"volume\":\"134 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JRSI : Jurnal Rekayasa Sistem & Industri\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.25124/jrsi.v10i01.583\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JRSI : Jurnal Rekayasa Sistem & Industri","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25124/jrsi.v10i01.583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
PT OSIN是一家在汽车制造领域经营业务的公司。公司采用流水线生产模式,采用先到先得的生产调度方法。FCFS方法的问题是在满足不确定的产品需求方面被认为没有达到最优,导致生产计划的延迟,这对货物的流动或分配有影响,并可能导致活动中的产量增加。提出了一种优化生产调度的改进方法,其重点是使调度系统的最大完工时间最小。本研究使用一种启发式方法来克服Campbell, Dudek, Smith (CDS)算法中的调度问题。CDS法是在Johnson算法的基础上发展起来的一种生产调度启发式方法,其目的是获取工作中心6类工序的若干序列,以分析每个工序的总时间(makespan)。比较两种方法,采用FCFS方法,按照初始订单时间的顺序排序调度,产生的总价值为2408.75分钟,而采用CDS算法,使用5次迭代,产生的总价值为881.3分钟。将该调度系统与CDS方法的应用结果进行比较,可以作为克服交货延迟和生产调度过程的改进建议。
Optimization of Scheduling using Heuristic Approach with Campbell Dudek Smith Algorithm (CDS) at PT OSIN
PT OSIN is a company that runs a business in the automotive manufacturing sector. The company applies a flow shop production model whose production pattern is line to line in series using the First Come First Serve production scheduling method. The problem with the FCFS method which is considered to have not reached the optimal enough in meeting uncertain product demands, causing delays in the production schedule, which has an impact on the flow or distribution of goods and can lead to increased production in activities. The proposed improvement method is made to optimize production scheduling, focusing on minimizing the makespan values in the scheduling system's order. This study uses a heuristic approach to the Campbell, Dudek, Smith (CDS) algorithm in overcoming scheduling problems. The CDS method is a production scheduling heuristic method developed from the Johnson algorithm in obtaining several sequences of 6 types of work processes at the work center which aims to analyze the total time for each processing process (makespan). Comparing the two methods using the FCFS method by sorting the scheduling according to the order of the initial order time produces a total value of 2,408.75 minutes, while using the CDS algorithm which uses 5 iterations produces a minor matter of 881.3 minutes. Comparing the results obtained by applying the scheduling system with the CDS method can be used as a proposed improvement in overcoming the delay in delivery and the production scheduling process.