The Optimization of Flow Shop Scheduling in Milling Stoper Production Using Campbell Dudek Smith Algorithm
DOI:
https://doi.org/10.14421/jiehis.6308Keywords:
CDS, Flow Shop, Makespan, Milling Stoper, and SchedulingAbstract
Non-optimal production scheduling in a flow shop system can increase makespan, idle time, and workload imbalance among machines. This study aims to optimize the production scheduling of a milling stopper in a manufacturing workshop using the CDS algorithm. This research contributes to improving the efficiency of production systems, particularly in conventional machining processes. The data used consist of processing times for four jobs. The CDS algorithm generates six alternative scheduling sequences, which are then compared based on their makespan values. The results show that the best job sequence is obtained in the fourth iteration, with the order starting from Top Arm, Bottom Arm, Base, and Silinder, resulting in a makespan of 1599 minutes. The Gantt chart indicates that the bottleneck occurs at the conventional milling machine, while idle time arises due to imbalanced processing times among machines. This study demonstrates that the CDS algorithm is effective in minimizing makespan and improving the efficiency of flow shop production systems.
References
Charista Elliani, M. F. G., Gozali, L., Daywin, F. J., & Doaly, C. O. (2021, March 7). Flowshop Scheduling Using Cds Algorithm, Bat Algorithm, And Tabu Search Algorithm At PT. Dynaplast Jatake. Proceedings of the International Conference on Industrial Engineering and Operations Management. 11th Annual International Conference on Industrial Engineering and Operations Management. https://doi.org/10.46254/AN11.20210493
Chen, C., Han, J., Liu, Z., & Tiong, R. L. K. (2023). Flow shop scheduling of hybrid make-to-stock and make-to-order in a distributed precast concrete production system. Cleaner Logistics and Supply Chain, 7, 100106. https://doi.org/10.1016/j.clscn.2023.100106
Febianti, E., Sudarsana, D. K., Susihono, W., Komaladewi, A. A. I. A. S., Mutaqin, A. I. S., Kurniawan, B., & Anugerah, A. B. (2025). Scheduling Flow Shop Project Sign Board Using the Campbell Dudek Smith and Cross Entropy Genetic Algorithm Method. Proceedings of the 10th International Conference And Exhibition on Sustainable Energy and Advanced Materials, 265. https://doi.org/10.1007/978-981-96-5063-7_22
Guo, H., Liu, J., Wang, Y., & Zhuang, C. (2024). An improved genetic programming hyper-heuristic for the dynamic flexible job shop scheduling problem with reconfigurable manufacturing cells. Journal of Manufacturing Systems, 74, 252–263. https://doi.org/10.1016/j.jmsy.2024.03.009
Han, J.-H., & Lee, J.-Y. (2023). Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing. Engineering Optimization, 55(10), 1742–1759. https://doi.org/10.1080/0305215X.2022.2124406
Hnaien, F., & Arbaoui, T. (2023). Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown. Annals of Operations Research, 328(2), 1437–1460. https://doi.org/10.1007/s10479-023-05324-3
Liang, Z., Zhong, P., Liu, M., Zhang, C., & Zhang, Z. (2022). A computational efficient optimization of flow shop scheduling problems. Scientific Reports, 12(1), 845. https://doi.org/10.1038/s41598-022-04887-8
Makarim, R. A., Maksum, A. H., & Rachmat, M. T. (2023). Optimization of Scheduling using Heuristic Approach with Campbell Dudek Smith Algorithm (CDS) at PT OSIN. Jurnal Rekayasa Sistem & Industri (JRSI), 10(01), 25. https://doi.org/10.25124/jrsi.v10i01.583
Mashuri, C., Mujianto, A. H., Sucipto, H., & Arsam, R. Y. (2020). Penerapan Algoritma Campbell Dudek Smith (CDS) untuk Optimasi Waktu Produksi Pada Penjadwalan Produksi. JURNAL SISTEM INFORMASI BISNIS, 10(2), 131–136. https://doi.org/10.21456/vol10iss2pp131-136
Nurfitriah, R., & Rakhmawati, F. (2024). Optimization Of Crude Palm Oil Production Machine Scheduling Using The Campbell Dudek Smith (CDS) Method. Advance Sustainable Science Engineering and Technology, 6(3), 02403012. https://doi.org/10.26877/asset.v6i3.731
Rossit, D. A., Tohmé, F., Frutos, M., Safe, M., & Vásquez, Ó. C. (2020). Critical paths of non-permutation and permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations, 281–298. https://doi.org/10.5267/j.ijiec.2019.8.001
Utami, I. D., Kuswandi, I., & Wibowo, D. E. (2020). Comparation of Schedulling Methods: Campbell Dudek Smith, Palmer and Dannenbring to Minimize Makespan. Journal of Physics: Conference Series, 1569(3), 032019. https://doi.org/10.1088/1742-6596/1569/3/032019
Yang, Y., & Li, X. (2022). A knowledge-driven constructive heuristic algorithm for the distributed assembly blocking flow shop scheduling problem. Expert Systems with Applications, 202, 117269. https://doi.org/10.1016/j.eswa.2022.117269
Zaied, A. N. H., Ismail, M. M., & Mohamed, S. S. (2021). PERMUTATION FLOW SHOP SCHEDULING PROBLEM WITH MAKESPAN CRITERION: LITERATURE REVIEW. . . Vol., (4).
Zhou, X., Liang, W., Yan, K., Li, W., Wang, K. I.-K., Ma, J., & Jin, Q. (2023). Edge-Enabled Two-Stage Scheduling Based on Deep Reinforcement Learning for Internet of Everything. IEEE Internet of Things Journal, 10(4), 3295–3304. https://doi.org/10.1109/JIOT.2022.3179231
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Haposan Vincentius Manalu, Insan Kamil, Oki Setiawan, Darti Purnama Sari, Siti Adriani, Ifti Luthviana Dewi, Robi Kurniawan, Lavita Indriani Br. Ginting, Khollilah Nuraini
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
(c) The Author(s). This article is distributed under a Creative Commons Attribution-ShareAlike 4.0 International License.
