Tip-II montaj hattı dengeleme problemleri için bir adaptif büyük komşuluk arama algoritması

The need for reducing the production costs that are increasing with competition conditions and customer-oriented production strategies reveals the necessity of redesigning the production phase, especially the assembly lines in this direction. In response to this need, type-II assembly line balancing problem which is used for redesigning an existing assembly line arises. In this study, an adaptive large neighborhood search (ALNS) algorithm is proposed for the type-II simple assembly line balancing problem (SALBP-II) and the version where this problem is enriched by considering the sequence-dependent setup times between operations (SALBPs-II). The effectiveness of the large neighborhood search (LNS) algorithm has been shown by studies on vehicle routing and scheduling problems. Vehicle routing problems aim to find the customer visit rankings that will make the minimum distance traveled as well as to find the optimum matching between a certain number of routes and a certain number of customers, while the SALBP-II aims to determine the assignment of a certain number of assembly tasks to a certain number of stations, which minimizes the cycle time. SALBPs-II aims to determine the task performing sequences that will minimize the workload at each station due to the sequence dependent setup times in addition to assign the assembly operations to the stations. This structural similarity between the vehicle routing problem and the SALBP-II and SALBPs-II reveals the potential of LNS to be an effective algorithm on both of these problems. In this respect, an ALNS algorithm for SALBP-II and SALBPs-II was developed and its performance was tested. The results show the performance of the proposed ALNS algorithm for SALBP-II and SALBPs-II is satisfactory.