SEQUENCING MODEL FOR A SEAT BELT MANUFACTURER

Yıl 2024, Sayı: 715, 243 - 267, 16.07.2024

Talha Satır , Aleyna Karataş , Yasemin Guvendi Filiz , Mohammed Mohanad Yawar Sayan , Ilayda Ulku

Öz

The study focuses on optimizing the production process of a Turkish family company specializing in seat belt manufacturing, boasting an annual capacity of 810,000 units and employing 150 individuals. Serving major clients such as Otokar, Ford Otosan, Bmc, Karsan, Anadolu Isuzu, Mercedes, Man, Temsa, and Türk Traktör, the company utilizes pressing, plastic injection, and assembly lines in its production. With a specific emphasis on the sequencing and scheduling of the assembly lines, a mathematical model was formulated and solved using GAMS software. Comparative analysis, incorporating scenario assessments, revealed that the proposed model significantly enhanced efficiency compared to various scenario outcomes.

Anahtar Kelimeler

Sequence and scheduling, assembly line, unfinished works, ERP (enterprise resource planning), APP (aggregate production planning)

SEQUENCING MODEL FOR A SEAT BELT MANUFACTURER

Öz

Ticari araç sektörüne yönelik emniyet kemeri ve yedek parça üretimi gerçekleştiren, yılda 810.000 emniyet kemeri üretebilen aile şirketi, müşterileri arasında Otokar, Ford Otosan, Bmc, Anadolu Isuzu, Mercedes, Man, Temsa, Türk Traktör gibi önemli markaları bulundurmaktadır. Firmanın üretim kapasitesi, pres, plastik enjeksiyon ve montaj hatlarından oluşmaktadır. Şirketin üretimini geliştirmek amacıyla emniyet kemeri montaj hatlarının sıralanması ve programlanmasını ele almaktadır.
Şirketin 3 adet emniyet kemeri montaj hattı bulunmaktadır. Sıralama ve çizelgeleme sorununu çözmek için matematiksel bir model geliştirilmiş ve model GAMS yazılımı kullanılarak çözülmüştür. Çalışmanın sonuçları, GAMS modelindeki tamamlanmamış senaryo analizlerinin karşılaştırmasıdır. Önerilen modelin sonuçları, farklı senaryo analizlerine dayalı sonuçlarla kıyaslandığında, önerilen modelin daha etkili sonuçlar elde ettiğini göstermektedir.

Anahtar Kelimeler

Sıra ve çizelgeleme, montaj hattı, tamamlanmamış işler, KKP (kurumsal kaynak planlama), APP (toplam üretim planlama)

Kaynakça

• Abdelsalam, N., Mohammoud, F., Eder, H., Abuyosef, A., Kaya, O., Kılıc, A. C., & Ulku, I. (2023). A Production Line Assignment Problem For A Textile Industry. Journal of Engineering Sciences and Design, 11(1), 22-32. https://dergipark.org.tr/en/pub/jesd/issue/76248/1101063 adresinden alındı Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 694-715. https://www.sciencedirect.com/science/article/abs/pii/S0377221704004801 adresinden alındı
• Bryant, R., Lakner, P., & Pinedo, M. (2022). On the optimality of the earliest due date rule in stochastic scheduling and in queueing. European Journal of Operational Research, 298(1), 202-212. https://www.sciencedirect.com/science/article/abs/pii/S0377221721008158 adresinden alındı
• Chen, X., Miao, Q., Lin, B. M., Sterna, M., & Blazewicz, J. (2022). Two-machine flow shop scheduling with a common due date to maximize total early work. European Journal of Operational Research, 300(2), 504-511. https://ideas.repec.org/a/eee/ejores/v300y2022i2p504-511.html adresinden alındı
• Cheng, L., Tang, Q., & Zhang, L. (2023). Mathematical model and adaptive simulated annealing algorithm for mixed-model assembly job-shop scheduling with lot streaming. Journal of Manufacturing Systems, 70, 484-500.
• Cho, W.-H., Shmoys, D., & Henderson, S. (2023). SPT optimality (mostly) via linear programming. Operations Research Letters, 51(1), 99-104. https://www.worldscientific.com/doi/abs/10.1142/S0217595923500409?download=true&journalCode=apjor adresinden alındı
• Hwang, H.-C., Lee, K., & Chang, S. Y. (2005). The effect of machine availability on the worst-case performance of LPT. Discrete Applied Mathematics, 148(1), 49-61. https://www.sciencedirect.com/science/article/pii/S0166218X0400383X adresinden alındı
• Jia, S., Bard, J. F., Chacon, R., & Stuber, J. (2015). Improving performance of dispatch rules for daily scheduling of assembly and test operations. Computers & Industrial Engineering, 90, 86-106. https://www.researchgate.net/publication/283097709_Improving_Performance_of_Dispatch_Rules_for_Daily_Scheduling_of_Assembly_Test_Operations adresinden alındı
• Jiang, X., Lee, K., & M. L. (2021). Ideal schedules in parallel machine settings. European Journal of Operational Research, 290(2), 422-434. https://www.sciencedirect.com/science/article/abs/pii/S0377221720307013 adresinden alındı
• Kim, S., & Jeong, B. (2007). Product sequencing problem in Mixed-Model Assembly Line to minimize unfinished works. Computers & Industrial Engineering, 53(2), 206-214. https://yonsei.elsevierpure.com/en/publications/product-sequencing-problem-in-mixed-model-assembly-line-to-minimi adresinden alındı
• Liao, C.-J., Shyur, D.-L., & Lin, C.-H. (2005). Makespan minimization for two parallel machines with an availability constraint. European Journal of Operational Research, 160(2), 445-456. https://www.researchgate.net/publication/4871987_Makespan_minimization_for_two_parallel_machines_with_an_availability_constraint adresinden alındı
• Lushchakova, I. N. (2006). Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints. European Journal of Operational Research, 171(1), 107-122. https://www.sciencedirect.com/science/article/abs/pii/S0377221704006174 adresinden alındı
• Qi, X., Bard, J. F., & Yu, G. (2006). Disruption management for machine scheduling: The case of SPT schedules. International Journal of Production Economics, 103(1), 166-184. https://ideas.repec.org/a/eee/proeco/v103y2006i1p166-184.html adresinden alındı
• Salama, S., Kaihara, T., Fujii, N., & Kokuryo, D. (2023). Dispatching Rules Selection Mechanism Using Support Vector Machine for Genetic Programming in Job Shop Scheduling. IFAC-PapersOnLine, 56(2), 7814-7819. https://www.sciencedirect.com/science/article/pii/S2405896323015525 adresinden alındı
• Wang, D., & Liao, F. (2021). Analysis of first-come-first-served mechanisms in one-way car-sharing services. Transportation Research Part B: Methodological, 22-41. https://www.sciencedirect.com/science/article/pii/S0191261521000436 adresinden alındı
• Winograd, G., & Kumar, P. (1996). The FCFS service discipline: Stable network topologies, bounds on traffic burstiness and delay, and control by regulators. Mathematical and Computer Modelling, 23(11-12), 115-129. https://www.sciencedirect.com/science/article/pii/S1474667016333511#! adresinden alındı
• Zhao, C., Ji, M., & Tang, H. (2011). Parallel-machine scheduling with an availability constrain. Computers & Industrial Engineering, 61(3), 778-781. https://www.sciencedirect.com/science/article/abs/pii/S0360835211001343 adresinden alındı