Scopus İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12573/395
Browse
2 results
Search Results
Conference Object Minimising the Cycle Time with Assembly Line Balancing and Worker Assignment: A Case Study in a Medical Device Manufacturer Company(ISRES Publishing, 2025-10-27) Kayser, A.; Sipahi, G.; Sevimli, O.; Toplu, N.; Turan, S.; Satic, U.In this research, we considered the mixed-model assembly line balancing and worker assignment problems of a medical device manufacturer in Türkiye. We combined these problems into a single integer programming model where multiple types of products can be assembled simultaneously on a single assembly line, and workers are assigned to workstations based on their abilities while ensuring the balance and efficiency of the assembly line. Our proposed approach seeks to minimise the cycle time and ability-based assignment costs on the assembly line. We used the Gurobi solver to find the optimal solution for the proposed problem. Our approach provides higher efficiency and results in a 76% increase in productivity without requiring additional work hours or workers. © 2025 Published by ISRES Publishing.Article Citation - WoS: 8Citation - Scopus: 12An Ant Colony Optimisation Algorithm for Balancing Two-Sided U-Type Assembly Lines With Sequence-Dependent Set-Up Times(Springer India, 2018-11-01) Delice, Yilmaz; Aydogan, Emel Kizilkaya; Soylemez, Ismet; Ozcan, UgurSome practical arrangements in assembly lines necessitate set-up times between consecutive tasks. To create more realistic models of operations, set-up times must be considered. In this study, a sequence-dependent set-up times approach for two-sided u-type assembly line (TUAL) structures is proposed for the first time. Previous studies on TUAL have not included set-up times in their analyses. Furthermore, an algorithm based on the Ant Colony Optimization (ACO) algorithm, which is using a heuristic priority rule based procedure has been proposed in order to solve this new approach. In this paper, we look at the sequence-dependent set-up times between consecutive tasks and consecutive cycles, called the "forward set-up time'' and the "backward set-up time'', respectively. Additionally, we examine the "crossover set-up time'', which arises from a new sequence of tasks in a crossover station. In order to model more realistic assembly line configurations, it is necessary to include sequence-dependent set-up times when computing all of the operational times such as task starting times and finishing times as well as the total workstation time. In this study, the proposed approach aims to minimize the number of mated-stations as the primary objective and to minimize the number of total workstations as a secondary objective. In order to evaluate the efficiency of the proposed algorithm, a computational study is performed. As can be seen from the experimental results the proposed approach finds promising results for all literature-test problems.