Sürdürülebilir Kalkınma Amaçları
Yazarlar
Yayınlar
- MakaleAçık Erişim2021Scopus SJRQ2Modeling and solving assembly line worker assignment and balancing problem with sequence-dependent setup times
Yilmaz, Hamid
Assembly lines appear with various differentiations in order to better include the disabled in the labor market and to increase production efficiency. In this way, the optimal workforce assignment problem that emerges heterogeneously is called assembly line worker assignment and balancing problem (ALWABP). This paper addresses the ALWABP where the simple version is enriched by considering sequence-dependent setup times between tasks. A mixed integer linear programming model is presented, and a simulated annealing algorithm is developed such as an NP-hard problem. In order to test the proposed solutions, 640 benchmark problems in the literature were combined and used. The solutions obtained through using the proposed algorithm are compared with the mixed integer programming model on the small-size test problems. Experimental results show that the proposed algorithm is more effective and robust for a large set of benchmark problems.
AtıfScopus14WoS12OpenAlex16
İncele - MakaleAçık Erişim2020Scopus SJRQ2A mathematical model and tabu search algorithm for multi-manned assembly line balancing problems with assignment restrictions
Yilmaz, Hamid; Yilmaz, Mustafa
A multi-manned assembly line is a set of workstations where task operations can be performed on multiple sides of the line. Such assembly lines are important for large products, such as buses, cars and trucks. In this study, a mathematical model for multi-manned assembly lines with assignment restrictions is proposed. The purpose of the mathematical model is to minimize the total number of workers and open multi-manned workstations along the line for a given cycle time simultaneously under various assignment restrictions. The model provides a more realistic situation for multi-manned assembly line problems. The tabu search algorithm (TSA) is also used to solve the problem. The performances of both methods on well-known data-set problems are analysed. Based on the computational experiments, the performance of the proposed TSA is compared with the mathematical model solutions on various problem instances. The experimental results verify the effectiveness and efficiency of the proposed TSA.
AtıfScopus33WoS28OpenAlex33İncele