Oğuz, K.Altuner, B.Anar, C.Reisoğlu, E.Karaca, M.N.Sevgen, Arya2025-01-252025-01-252024979-835037943-3https://doi.org/10.1109/ASYU62119.2024.10757011https://hdl.handle.net/20.500.14365/5863IEEE SMC; IEEE Turkiye SectionWe are proposing an evolutionary approach to the identical parallel machine scheduling problem using a novel representation for genetic algorithms. The genetic algorithm is compared to the mathematical model of the problem. Both of the approaches are implemented in Python using related libraries. The results show that, specially for the larger instances of the problem, the genetic algorithm performs better; it finds an appropriate solution with low tardiness values in minutes, rather than hours when the mathematical model is used. Our study shows that genetic algorithms a valid approach for finding solutions to the identical parallel machine scheduling problem. © 2024 IEEE.eninfo:eu-repo/semantics/closedAccessGenetic AlgorithmIdentical Parallel Machine Scheduling ProblemParallel Machine SchedulingConference Object10.1109/ASYU62119.2024.107570112-s2.0-85213361904