Penerapan Algoritma Campbell Dudek Smith (CDS) untuk Optimasi Waktu Produksi Pada Penjadwalan Produksi

*Chamdan Mashuri scopus  -  Hasyim Asy’ari University, Indonesia
Ahmad Heru Mujianto  -  Hasyim Asy’ari University, Indonesia
Hadi Sucipto  -  Hasyim Asy’ari University, Indonesia
Rinaldo Yudianto Arsam  -  Hasyim Asy’ari University, Indonesia
Received: 28 Oct 2019; Revised: 6 Jun 2020; Accepted: 29 Sep 2020; Published: 6 Nov 2020; Available online: 6 Nov 2020.
DOI: https://doi.org/10.21456/vol10iss2pp131-136 View
CTA Agreement
Subject
Type Research Instrument
  Download (120KB)    Indexing metadata
Open Access
Citation Format:
Abstract

Research on optimizing production time using the dudek smith campbell algorithm (CDS) in scheduling the production process aims to makepan optimization for machine operations to produce 12 size griddle products, 14 griddle sizes, 16 griddle sizes, 18 griddle sizes and 20 griddle sizes to get the makepan values. optimal. The method applied by the Campbell Dudek and Smith (CDS) algorithm, CDS is a method used in flowshop scheduling developed from Johnson's rule which is able to minimize the makespan of 2 machines arranged in series. The CDS method is very suitable for production characters who apply machine sequences to the production process. CDS produces several iterations that have the value of makespan, from those iterations, the minimum value of makespan is to determine the order of products to be produced. This research resulted in an application that can schedule products to be produced by machines automatically. From the test results with a total production of 12 pieces on each product with 6 repetitions, the minimum value of makespan is 210.12 minutes with a sequence of product works 20 pans, 18 pans, 16 pans, 14 pans, and 12 pans. Accuracy of results Application testing shows 99.99% for the first time and 99.96% for the second time when compared to manual calculations

Note: This article has supplementary file(s).

Keywords: Optimization; Production; Scheduling; CDS; Makespan.

Article Metrics:

  1. Bouzidi and M. E. Riffi, 2014. Cat Swarm Optimization to Solve Job Shop Scheduling Problem," IEEE, vol. 2, pp. 4799-5979
  2. C.W. Moreno, 2006. Optimization in Production Operations Optimal “Lean Operations” in Manufacturing," Advanced Process Management, vol. 513, pp. 469-8629
  3. Christianta, Y. & Sunarni, T., 2012. "Usulan Penjadwalan Produksi Dengan Metode Campbell Dudek And Smith". Jurnal Semantik 2012, 30-35
  4. Yongqing, J. and P. Fucheng, 2017. Improved Heuristic Algorithm for Modern Industrial Production Scheduling, in The 9th International Conference on Modelling, Identification and Control (ICMIC 2017), Kunming China
  5. Yao, J. and Z. Deng, 2015. Scheduling Optimization in the Mass Customization of Global Producer Services," IEEE Transactions On Engineering Management , pp. 0018-9391
  6. Kurnia, Yasra, R., & Afma, V.M., 2013. "Penjadwalan Produksi Dengan Menggunakan Metode Campbell Dudek & Smith Pada Mesin Laser Marking Jenis Evertech Untuk Meminimalisasi Makespan". Jurnal Profesiensi, 93-103
  7. Cesari, L.W., 2016. Optimasi Waktu Produksi dan Analisis Kepriodikan pada Graf Sistem Produksi Ber-loop dengan Menggunakan sistem Persamaan Linier Aljanar MAX-PLUS," Perpustakaan Yogyakarta, Yogyakarta
  8. Alharkan, M., 2005. Algorithms for Sequencing and Scheduling, Riyadh, Saudi Arabia
  9. Wati, D.A., & Rochman, Y.A., 2013. Model penjadwalan matakuliah secara otomatis berbasis algoritma particle swarm optimization. Jurnal Rekayasa Sistem Industri, 22-31
  10. Widodo, C.E., 2014. Optimasi Penjadwalan Mesin Produksi Dengan Menggunakan Metode Campbell Dudek Smith Pada Perusahaan Manufaktur. Skripsi

Last update: 2021-04-20 13:09:51

No citation recorded.

Last update: 2021-04-20 13:09:51

No citation recorded.