Tunahan KuzuYaren CanElvin SarıDevin DuranSude Dila CeylanMert PaldrakMustafa Arslan OrnekSarı, ElvinCeylan, Sude DilaCan, YarenÖrnek, Mustafa ArslanKuzu, TunahanDuran, DevinPaldrak, MertN.M. Durakbasa , M.G. Gençyılmaz2025-10-0620249789819650583, 9783031991585, 9783031948886, 9789819667314, 9789811937156, 9783030703318, 9789811622779, 9789811969447, 9789819701056, 9789819748051978303153990921954364, 219543562195-435610.1007/978-3-031-53991-6_542-s2.0-85187786066https://www.scopus.com/inward/record.uri?eid=2-s2.0-85187786066&doi=10.1007%2F978-3-031-53991-6_54&partnerID=40&md5=36507707f21ae1e130bb7b2d3935e032https://gcris.yasar.edu.tr/handle/123456789/8324https://doi.org/10.1007/978-3-031-53991-6_54This study provides an overview of the definition of long setup times and lateness due to the wide variety of models produced in the garment industry the solutions developed to solve these problems and the designs to be proposed. The setup times of the product produced in the Multi-Model Assembly Line vary according to the model type. In this study we considered a single machine as an assembly line and adapted Single Machine Scheduling with Sequence-Dependent setup times problem to Multi-Model Assembly Line Sequencing with sequence-dependent setup times problem for the garment industry. To solve this problem we used two different solution techniques: Meta-Heuristic Algorithms and a mathematical model that includes the setup process and lateness accordingly suggested. Two different metaheuristic algorithms Tabu Search and Simulated Annealing were used in this paper. SA algorithm Tabu Search Algorithm and mathematical model were used to find optimal and near-optimal results which were compared. The metaheuristic achieved favourable solutions when comparing the results with mathematical model results. The mathematical model suggested was solved utilizing version 20.1 of ILOG CPLEX OPTIMIZATION STUDIO. The simulated Annealing and Tabu Search algorithm suggested were solved utilizing version R2023a of MATLAB. The obtained results are compared with respect to solution quality and computational time. © 2024 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessGarment Industry, Metaheuristics, Optimization, Scheduling, Sequence Dependent Setup Times, Assembly, Assembly Machines, Heuristic Algorithms, Learning Algorithms, Scheduling Algorithms, Tabu Search, Assembly Line, Garment Industries, Meta-heuristics Algorithms, Metaheuristic, Model Assembly, Multi-modelling, Optimisations, Scheduling, Sequence-dependent Setup Time, Set-up Time, Simulated AnnealingAssembly, Assembly machines, Heuristic algorithms, Learning algorithms, Scheduling algorithms, Tabu search, Assembly line, Garment industries, Meta-heuristics algorithms, Metaheuristic, Model assembly, Multi-modelling, Optimisations, Scheduling, Sequence-dependent setup time, Set-up time, Simulated annealingSchedulingMetaheuristicsSequence Dependent Setup TimesOptimizationGarment IndustryConference Object