SCHEDULING OF PAINTED PRODUCTS AT PT. ABC WITH A BRANCH, BOUND, AND NEIGHBORHOOD SEARCH ALGORITHM TO MINIMIZE THE MEAN FLOW TIME
Abstract
- PT. ABC was a manufactur company which on the job of metal coating (ZINCALUME) and painted coating (COLORBOND). Its product manufacturing was carrried in metal coating MCL 2 (Metal Coating Line 2) plant, paint coating or painting product was the most demanded by costumer expecially in MCL 2. So that, it was needed a processing time quickly, For it solution, appropriately with a scheduling. The background of this research was a PT. ABC has not been able to fill all of customer orders, because MCL 2 machine was be still new, and has not been sequenced that caused bottleneck. Method of this research was a branch and bound and neighborhood search algorthm. The purpose of this research was to minimize mean flow time at MCL 2. Existing scheduling which used by the company was a FCFS (First Come First Served). New scheduling would be divided the products into two batch which based on dimensions that were, 0,20 x 914 mm and 0,25 x 914 mm. In existing conditon, mean flow time on dimensions of 0,20 x 914 mm and 0,25 x 914 mm were 43,23 hours and 182,76 hours. The research’s result of mean flow time proved that the new scheduling by using branch and bound and neighborhood search algorthm on batch of 0,20 x 914mm was 18,42 hours, with its sequencing was a job 14- job 21- job 20- job 11- job 15 – job 8- job 3 –job 4- job 9- job 7, and then, with a neighborhood search, its sequencing was a job 14- job 20- job 21- job 11- job 15 – job 8- job 3 –job 4- job 9- job 7. For the bacth of 0,25 x 914mm , on branch and bound algorthm, it sequencing was a job 6- job 18- job 2- job 22- job 5- job 10- job 19- job 16- job 12- job 1- job 23- job 17- job 13, and then with neighborhood search , its sequencing was a job 6- job 18- job 2- job 22- job 5- job 10- job 19- job 12- job 16- job 1- job 17- job 23- job 13, they had 147,13 hours for mean flow time. Lowering of mean flow time between existing conditon with two method which used, on batch of 0,20 x 914 mm was a 57 percent and then for 0,25 x 914 mm, was a 19 percent.
References
Baker, Kenneth R., and Dan Trietsch. 2018. “Principles of Sequencing and Scheduling: Second Edition.” Principles of Sequencing and Scheduling: 1–633.
Ghith, Ehab Seif, and Farid Abdel Aziz Tolba. 2022. “Design and Optimization of PID Controller Using Various Algorithms for Micro-Robotics System.” Journal of Robotics and Control (JRC) 3(3): 244–56.
Herry Christian Palit, Tessa Vanina Soetanto, and Hermin Novianti. 2003. “PENJADWALAN PRODUKSI FLEXIBLE FLOWSHOPS DENGAN SEQUENCE-DEPENDENT SETUP TIMES MENGGUNAKAN METODE RELAKSASI LAGRANGIAN (Studi Kasus Pada PT. Cahaya Angkasa Abadi).” Jurnal Teknik Industri 5(2): 111–19. http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/16027.
Ismawati Khotimah, Hagni Wijayanti, and Sri Setyaningsih. 2021. “Penjadwalan Integer Linear Programming Pada Penjadwalan Produksi Tipe Flowshop Dan Program Optimasi Waktu Dengan Metode Branch and Bound.” JMT : Jurnal Matematika dan Terapan 3(1): 44–51.
Saiful, Mangngenre, Amrin Rapi, and Wendy Flannery. 2014. “Penjadwalan Produksi Dengan Metode Branch and Bound Pada Pt. Xyz.” Bksti: 2–6. http://repository.unhas.ac.id/bitstream/handle/123456789/10832/JURNAL UNTUK BKSTI 2014-IPUL MAKASSAR.pdf;jsessionid=5F7920A6FE4F38D98AC375755EC064E9?sequence=1.
Pinedo, M., 2008. Scheduling Theory, Algorithms, and System Thirt Edition. Springer. New York.
Riyanti, Eka. 2004. Application of the Branch And Bound Algorithm for Determining Routes for Attractions. Thesis Department of Informatics Engineering, Faculty of Engineering and Computer Science, Indonesian Computer University: Bandung.
Purwanto, A., & Sudargini, Y. (2021). Partial least squares structural squation modeling (PLS-SEM) analysis for social and management research: a literature review. Journal of Industrial Engineering & Management Research, 2(4), 114-123.
Sambodo, Maxensius Tri, Mesnan Silalahi, and Nur Firdaus. 2022. “Exploration of Technological Disruptive in the Energy Sector in Indonesia: Toward Low Carbon Development.” SSRN Electronic Journal: 1–19.
Sc, B. 2014. “Industrial Engineering and Management Science.” Industrial Engineering and Management Science.
Sutanto, Gunado. 2000. Branch And Bound Algorithm And Genetic Algorithm For Flowshop Scheduling With Multiple Purpose Functions. Thesis Department of Industrial Engineering, Faculty of Engineering, Petra Christian University: Surabaya.
Sutanto, J., et. al. 2004. Brach and Bound Algorithm for Scheduling Problems on Parallel Machines. Journal of Informatics Engineering. Computational Science and Engineering Laboratory. Informatics Engineering Department: ITB
Syahril, S., Sihotang, M., Hadinegoro, R., Sulastri, E., Rochmad, I., Cahyono, Y., & Purwanto, A. (2022). Hospitals Cusptomer e-loyalty: How The Role of e-service quality, e-recovery service quality and e-satisfaction?. UJoST-Universal Journal of Science and Technology, 1(1), 23-27.
Suyanto. 2010. Deterministic or Probabilistic Optimization Algorithm. Science House. Yogyakarta.
Trijayanto, Bastian E. 2012. Comparison of Scheduling Methods on Single Machine Flow Shop Flow Patterns with Existing Schedules, Insertion Techniques, and Neighborhood Search. Thesis Department of Industrial Engineering, Faculty of Engineering, University of Sultan Ageng Tirtayasa: Cilegon.
