Turker, A. KursadSel, Cagri2025-01-212025-01-2120112147-1762https://hdl.handle.net/20.500.12587/25426This paper presents a scheduling problem on parallel machines with sequence-dependent setup times and setup operations that performed by a single server. The main purpose is to get minimum makespan of the schedule. The system is formulated as genetic algorithm with problem sizes consisting of two machines and 10, 20 and 30 jobs. A genetic algorithm is developed using random data sets. The optimum results are obtained using a string based permutation algorithm which scans all alternatives. As a result, proposed algorithm is effective to solve P2,S|STsd|Cmax scheduling problem on reasonable runtime and the results of the algorithm which are close to optimum solution values. Effectiveness of the solution is presented considering approximation rates of the genetic algorithm solutions to the optimum results obtained for P2,S|STsd|Cmax problem.eninfo:eu-repo/semantics/closedAccessParallel Machine Scheduling; Genetic Algorithm; Permutation AlgorithmArticle241113123Q2WOS:000421116000015N/A